210. Best Time to Buy and Sell Stock with Cooldown

You are given an integer array prices where prices[i] is the price of a stock on the iᵗʰ day.

You may complete any number of transactions (buy one share and sell one share of the stock multiple times) subject to these rules:

  • After you sell a share, you cannot buy on the very next day (i.e. there is a one-day cooldown).
  • You may not hold more than one share at a time; that is, you must sell before you buy again.

Return the maximum profit you can achieve.

Example 1:

Input: prices = [1,2,3,0,2]

Output: 3

Explanation: transactions = [buy, sell, cooldown, buy, sell]

Example 2:

Input: prices = [1]

Output: 0

Explanation: Only one day — no transaction is possible.

Now Your Turn!

Pick the correct output for the given input

Input: prices = [3,2,6,5,0,3]

Still unsure what the problem is asking ?

Let’s go through a few more examples, step by step, to make it clearer.

Constraints:

  • 1 ≤ prices.length ≤ 5000
  • 0 ≤ prices[i] ≤ 1000

Fun Facts

0
class Solution {
public:
int maxProfit(const vector<int>& prices) {
// Your code goes here
}
};
Test Case

Input:

Prices
to save your code