LeetCode动态规划309|714

Erin Wang

于 2024-03-28 23:03:45 发布

阅读量139

点赞数 1

分类专栏： LeetCode 文章标签： leetcode 动态规划算法

本文链接：https://blog.youkuaiyun.com/ErinWang666/article/details/137127187

版权

LeetCode 专栏收录该内容

18 篇文章

订阅专栏

309最佳买卖股票时机含冷冻期

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        # 0持有 1不持有 2当天卖出 3冷冻
        dp = [[0] * 4 for _ in range(len(prices))]
        dp[0][0] = -prices[0]
        dp[0][1] = 0
        dp[0][2] = 0
        dp[0][3] = 0
        for i in range(1, len(prices)):
            dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i], dp[i - 1][3] - 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[len(prices) - 1][1], dp[len(prices) - 1][2], dp[len(prices) - 1][3])

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

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