Best Time to Trade Stock

Easy

/problems/best-time-to-trade-stock

2000 ms128 MB2 visible tests

Problem statement

A list records one stock price per day. Choose one day to buy and a later day to sell, then return the largest profit available. Return 0 when no profitable trade exists.

Your function

Implement this function and return the result. CodeSprint supplies each test case automatically.

maxProfit(prices) → number

prices: number[]

Examples

Example 1

Input

prices = [7, 1, 5, 3, 6, 4]

Output

Example 2

Input

prices = [7, 6, 4, 3, 1]

Output

Constraints

1 <= prices.length <= 100,000
0 <= prices[i] <= 1,000,000