Best Time to Buy and Sell Stock with Cooldow

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]

原来思路来自：https://leetcode.com/discuss/71246/line-constant-space-complexity-solution-added-explanation

首先定义了四种状态，

Buy[i]: 第i步执行购买，所可能获得的最大利益

Sell[i]: 第i步之行卖出，所能获得的最大利益

cooldown[i]: 卖出之后的冷冻期，能获得的最大利益

noop[i]: 在持有股票的情况下，什么都不干

状态转移方程是:

buy[i] = coolDown[i-1]-prices[i],

 coolDown[i] = max(coolDown[i-1], sell[i-1]), 

noOp[i] = max[noOp[i-1], buy[i-1]]] 

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

代码如下：

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int buy = INT_MIN, noop = INT_MIN;
        int cooldown = 0, sell = 0;
        for (auto p:prices) {
            int buy_pre = buy;
            buy = cooldown - p;
            cooldown = max(cooldown, sell);
            noop = max(noop,buy_pre);
            sell = max(noop,buy_pre)+p;
        }
        return max(sell,cooldown);
    }
};