代码随想录算法训练营第44天 |股票

1、买卖股票IV

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

一模一样的思路，买卖k次，定义2k+1种状态做dp即可

2、冷冻期买股票

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

也是一模一样的思路，只是更新持有股票的一天（dp[i][1]）的时候要从 dp[i-2][0]更新。此外注意第一天就买股票的特殊情况

3、手续费买股票

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

就是在更新的时候扣除手续费就可以了