LeetCode:Best Time to Buy and Sell Stock with Cooldown

Best Time to Buy and Sell Stock with Cooldown

Total Accepted: 10521  Total Submissions: 29127  Difficulty: Medium

Say you have an array for which the ith element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like 

(ie, buy one and sell one share of the stock multiple times) with the following restrictions:

• You may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).
• After you sell your stock, you cannot buy stock on next day. (ie, cooldown 1 day)

Example:

prices = [1, 2, 3, 0, 2]
maxProfit = 3
transactions = [buy, sell, cooldown, buy, sell]

Credits:
Special thanks to @dietpepsi for adding this problem and creating all test cases.

Subscribe to see which companies asked this question

Hide Tags

  Dynamic Programming

Hide Similar Problems

  (M) Best Time to Buy and Sell Stock (M) Best Time to Buy and Sell Stock II

思路：

动规：状态转移方程：

buy[i] = max(buy[i-1], sell[i-2]-prices[i]);

sell[i] = max(sell[i-1], buy[i-1]+prices[i]);

code:

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int n = prices.size();
        if(0==n) return 0;
        int buy[n], sell[n];
        
        sell[0]=0;
        sell[1]=0;
        sell[2]=0;
        buy[0]=-prices[0];
        buy[1]=-prices[1];
        
        for(int i=1;i<n;i++){
            buy[i] = max(buy[i-1],sell[i-2]-prices[i]);
            sell[i] = max(sell[i-1], buy[i-1]+prices[i]);
        }
        return sell[n-1];
    }
};

空间优化：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
    
	int n = prices.size();

    	int b0 = -prices[0], b1 = b0;
    	int s0 = 0, s1 = 0, s2 = 0;

    	for(int i = 1; i < prices.length; i++) {
       		b0 = max(b1, s2 - prices[i]);
        	s0 = max(s1, b1 + prices[i]);
        	b1 = b0; s2 = s1; s1 = s0; 
    	}
    	return s0;
	}
};