Best Time to Buy and Sell Stock with Cooldown
You are given an array prices where prices[i] is the price of a given stock on the ith day.
Find the maximum profit you can achieve. You may complete as many transactions as you like (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
Input: [1]
Output: 0
Hints
Think about how the cooldown period affects future buying decisions. How can you track whether you're allowed to buy stock on a given day?
Consider maintaining separate variables for the maximum profit achievable in each state (held, sold, cooldown) at each day. How do these states transition between days?
Derive the recurrence relations for each state. How does the profit update when transitioning from one state to another, considering the cooldown constraint?
Best Time to Buy and Sell Stock with Cooldown
You are given an array `prices` where `prices[i]` is the price of a given stock on the `i`th day.