Leetcode: Best Time to Buy and Sell Stock with Cooldown

Say you have an array for which the i^th 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]

这个比较难，DP的状态方程不好找。分不同情况考虑。

1. 假设第i天卖掉股票 (profitSell)

    a. 如果第(i-1)天什么都不做 （profitRest)，那么相当于第i天买了再卖，profitSell[i] = profitRest[i-1]

    b. 如果第(i-1)天卖掉了股票（profitSell），必须第(i-1)天买了，第i天卖。profitSell[i] = profitSell[i-1] - prices[i-1] + prices[i]。

2. 假设第i天什么都不做，profitRest[i] = max(profitSell[i-1], profitRest[i-1]).

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int maxProfiltSell = 0;
        int maxprofitRest = 0;
        for (int i = 1; i < prices.size(); ++i) {
            int tmp = maxProfiltSell;
            maxProfiltSell = max(maxProfiltSell - prices[i-1] + prices[i], maxprofitRest);
            maxprofitRest = max(maxprofitRest, tmp);
        }
        
        return max(maxProfiltSell, maxprofitRest);
    }
};