dp_41

最新推荐文章于 2024-08-15 09:47:08 发布

阿远_LIFE

最新推荐文章于 2024-08-15 09:47:08 发布

阅读量159

点赞数 2

分类专栏：刷题文章标签： python 算法力扣

本文链接：https://blog.csdn.net/wzy_777/article/details/141142895

版权

刷题专栏收录该内容

38 篇文章 0 订阅

订阅专栏

121. 买卖股票的最佳时机

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

122. 买卖股票的最佳时机 II

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

123. 买卖股票的最佳时机 III

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