Medium
Quiz
#122 Best Time to Buy and Sell Stock II
APPROACH
An integer array prices is given where prices[i] is the stock price on day i.
Each day you may buy and/or sell the stock. You can hold at most one share at a time, but you may complete multiple transactions — even selling and buying on the same day, as long as you never hold more than one share simultaneously.
Return the maximum profit you can achieve.
Example 1:
Input: prices = [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.
Total profit is 4 + 3 = 7.
Example 2:
Input: prices = [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
Total profit is 4.
Example 3:
Input: prices = [7,6,4,3,1]
Output: 0
Explanation: There is no way to make a positive profit, so we never buy the stock to achieve the maximum profit of 0.
1 of 4
1:00
What is the optimal approach for this problem?