214. Best Time to Buy and Sell Stock with Cooldown
MediumDynamic Programming
You are given an array prices where prices[i] is the price of a given stock on the i-th day. Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions: - After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day). Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
Examples
Input: [1,2,3,0,2]
Output: 3
Explanation: Buy at 1, sell at 3 (profit 2), cooldown, buy at 0, sell at 2 (profit 2)... best net is 3.
Constraints
- 1 <= prices.length <= 5000
- 0 <= prices[i] <= 1000
Loading...
Run checks all cases above. Submit evaluates all test cases.