代码随想录算法训练营Day51 | 动态规划(12/17) LeetCode 309.最佳买卖股票时机含冷冻期 714.买卖股票的最佳时机含手续费

最后一天的股票买卖问题练习！

第一题

309. Best Time to Buy and Sell Stock with Cooldown

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:

• After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).

Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

相比LC122，这道题加了一个冷冻期，因此有四种状态：

• 状态一：持有股票状态（今天买入股票，或者是之前就买入了股票然后没有操作，一直持有）
  • 不持有股票状态，这里就有两种卖出股票状态
• 状态二：保持卖出股票的状态（两天前就卖出了股票，度过一天冷冻期。或者是前一天就是卖出股票状态，一直没操作）
• 状态三：今天卖出股票
• 状态四：今天为冷冻期状态，但冷冻期状态不可持续，只有一天！

因此代码如下， dp的过程可以对应这几种状态。

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        n = len(prices)
        if n == 0:
            return 0
        dp = [[0] * 4 for _ in range(n)]  
        dp[0][0] = -prices[0]  
        for i in range(1, n):
            dp[i][0] = max(dp[i-1][0], max(dp[i-1][3], dp[i-1][1]) - prices[i])  
            dp[i][1] = max(dp[i-1][1], dp[i-1][3])  
            dp[i][2] = dp[i-1][0] + prices[i]  
            dp[i][3] = dp[i-1][2]  
        return max(dp[n-1][3], dp[n-1][1], dp[n-1][2]) 

第二题

714. Best Time to Buy and Sell Stock with Transaction Fee

You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee.

Find the maximum profit you can achieve. You may complete as many transactions as you like, but you need to pay the transaction fee for each transaction.

Note:

• You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
• The transaction fee is only charged once for each stock purchase and sale.

和LC122比起来，这道题只需要在计算卖出操作的时候减去手续费就可以了，代码几乎是一样的。

class Solution:
    def maxProfit(self, prices: List[int], fee: int) -> int:
        n = len(prices)
        dp = [[0] * 2 for _ in range(n)]
        dp[0][0] = -prices[0] 
        for i in range(1, n):
            dp[i][0] = max(dp[i-1][0], dp[i-1][1] - prices[i])
            dp[i][1] = max(dp[i-1][1], dp[i-1][0] + prices[i] - fee)
        return max(dp[-1][0], dp[-1][1])