代码随想录算法训练营第四十二天|LeetCode 188 买卖股票的最佳时机 IV，LeetCode 309 买卖股票的最佳时机含冷冻期，LeetCode 714 买卖股票的最佳时机含手续费-CSDN博客

1.LeetCode 188 买卖股票的最佳时机 IV

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

第一题结束

2.LeetCode 309 买卖股票的最佳时机含冷冻期

题目链接：309. 买卖股票的最佳时机含冷冻期

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        l = len(prices)
        if l < 2:
            return 0
        
        dp = [[0 for _ in range(3)] for _ in range(l)]
        dp[0][0] = -prices[0]
        dp[0][1] = 0
        dp[0][2] = 0

        for i in range(1, l):
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][2] - prices[i])
            dp[i][1] = dp[i - 1][0] + prices[i]
            dp[i][2] = max(dp[i - 1][2], dp[i - 1][1])
        
        return max(dp[-1][-1], dp[-1][1])

3.LeetCode 714 买卖股票的最佳时机含手续费

题目链接：714. 买卖股票的最佳时机含手续费

class Solution:
    def maxProfit(self, prices: List[int], fee: int) -> int:
        l = len(prices)
        dp = [[0 for _ in range(2)] for _ in range(l)]
        dp[0][0] = -prices[0]
        for i in range(1, l):
            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 dp[-1][-1]

第三题结束

股票问题总结：

股票问题其实弄清楚dp的关系和前后条件就可以做出来了

今天用时1.5h