DSA problem
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 buy it then immediately sell it on the same day.
Find and return the maximum profit you can achieve. Unlike the first version of this problem, here you are allowed to complete as many transactions as you like.
Examples
Example 1
Input:
prices = [7,1,5,3,6,4]Output:
7Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 4. Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 3. Total profit = 7.
Example 2
Input:
prices = [1,2,3,4,5]Output:
4Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 4. The whole rising run can be captured.
Example 3
Input:
prices = [7,6,4,3,1]Output:
0Explanation: Prices only fall, so no transaction is made and the maximum profit is 0.
Constraints
- 1 <= prices.length <= 3 * 10^4
- 0 <= prices[i] <= 10^4
3 hints and a full solution walkthrough with step-by-step visualizations are available in the practice editor.