【leetcode每日刷题】【DP】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:

Input: [1,2,3,0,2]
Output: 3 
Explanation: transactions = [buy, sell, cooldown, buy, sell]

使用动态规划的方法，维护两个数组sell和buy，分别表示第i天以sell结尾或者cooldown结尾获得的最大利润，和以buy结尾或cooldown结尾获得的最大利润。最后返回最后一天获得的最大利润。

第i天以buy结尾利润应该是 sell[i-2] - prices[i] 如果第i天买进则必须在第i-2天卖掉，因为有一天的cooldown时间，如果以cooldown结尾应该是buy[i-1]

第i天以sell结尾利润应该是 buy[i-1] + prices[i] 即卖掉前一天买的股票，如果以cooldown结尾应该是sell[i-1],利润不变

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        if len(prices) <= 1:
            return 0
        buy = [-1 for i in range(len(prices))]
        sell = [-1 for i in range(len(prices))]
        buy[0] = -prices[0]
        buy[1] = max(-prices[0], -prices[1])
        sell[0] = 0
        sell[1] = max(prices[1] - prices[0], 0)
        for i in range(2, len(prices)):
            # 可以是buy或者cooldown
            buy[i] = max(buy[i-1], sell[i-2] - prices[i])
            # 可以是sell或者cooldown
            sell[i] = max(buy[i-1] + prices[i], sell[i-1])
        return max(buy[len(prices)-1], sell[len(prices)-1], 0)

if __name__ == "__main__":
    prices = [1,2,3,0,2]
    solution = Solution()
    print(solution.maxProfit(prices))