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]

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

做dp的题一定要分析好状态，这里有cooldown，所以对于第i天，有buy，sell，rest这3种状态，那么这三者的关系是：

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

因为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(n)的空间复杂度简化成o(1)。代码如下：

public class Solution {
    public int maxProfit(int[] prices) {
        int prevsell = 0, sell = 0, prevbuy = Integer.MIN_VALUE, buy = Integer.MIN_VALUE;
        for (int price: prices) {
            prevbuy = buy;
            buy = Math.max(prevsell - price, prevbuy);
            prevsell = sell;
            sell = Math.max(prevbuy + price, prevsell);
        }
        return sell;
    }
}