We’re preparing your current view and syncing the latest data.
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.
An integer array prices representing the stock price on each day.
An integer representing the maximum profit obtainable.
1 <= prices.length <= 10^5, 0 <= prices[i] <= 10^4
Example 1
Input
[7,1,5,3,6,4]
Output
5
Explanation
Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
Example 2
Input
[7,6,4,3,1]
Output
0
Explanation
No profitable transaction possible, return 0.