Description
You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.
Examples
Input:
prices = [7,1,5,3,6,4]Output:
5Explanation:
Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Input:
prices = [7,6,4,3,1]Output:
0Explanation:
No profit can be made as prices only decrease.
Input:
prices = [3,2,6,5,0,3]Output:
4Explanation:
Buy on day 2 (price = 2) and sell on day 3 (price = 6), profit = 6-2 = 4. Even though there is a lower price later (0 on day 5), the highest price after day 5 is only 3, yielding less profit.
Constraints
- •
1 ≤ prices.length ≤ 10⁵ - •
0 ≤ prices[i] ≤ 10⁴