Best Time to Buy and Sell Stock II
You are given an integer array prices where prices[i] is the price of a given stock on the i^th day.
On each day, you may decide to buy and/or sell the stock. You can only hold at most one share of the stock at any time. However, you can sell and buy the stock multiple times on the same day, ensuring you never hold more than one share of the stock.
Find and return the maximum profit you can achieve.
Example 1
Input
prices = [7,1,5,3,6,4]Output
7Buy on day 2 at price 1 and sell on day 3 at price 5 for profit 4, then buy on day 4 at price 3 and sell on day 5 at price 6 for profit 3, for a total profit of 7.
Example 2
Input
prices = [1,2,3,4,5]Output
4Buy on day 1 at price 1 and sell on day 5 at price 5 for a total profit of 4.
Constraints
- 1 <= prices.length <= 3 * 10^4
- 0 <= prices[i] <= 10^4