309. Best Time to Buy and Sell Stock with Cooldown

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]

这个题的解法是在是太牛叉了。。。膜拜算法大神dietpepsi.

广大群众可以去看看，大致思路是维护三个一位数组分别记录sell, buy, rest。

其中:

buy[i] = max(rest[i - 1] - price, buy[i - 1])

rest[i] = max(buy[i - 1], rest[i - 1], sell[i - 1])

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

因为买了之后才休息，所以buy[i] <= rest[i], 所以对于第二个公式：rest[i] = max(rest[i - 1], sell[i - 1])；

由于休息之后才能卖，所以rest[i] <= sell[i]，所以第二个公式编程：rest[i] = sell[i - 1]；

现在就由原来三个公式变成了两个

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

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

然而，因为每次更新只和前两个数字有关，数组可以压缩到四个变量，实现了O(1)空间。

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int buy = INT_MIN, pre_buy = 0, sell = 0, pre_sell = 0;
        for (int price : prices) {
            pre_buy = buy;
            buy = max(pre_sell - price, pre_buy);
            pre_sell = sell;
            sell = max(pre_buy + price, pre_sell);
        }
        return sell;
    }
};

代码中pre_sell和pre_buy记录上次交易的数据，每次扫描一个价格更新数据，时间复杂度为O(n)。