代码随想录49天| 121.买卖股票的最佳时机 122.买卖股票的最佳时机II

121.买卖股票的最佳时机

题目链接：https://leetcode.cn/problems/best-time-to-buy-and-sell-stock/

dp[i][?]需要二维数组 来维护第i天是否持有股票 记录持有或者不持有的现金量

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

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

题目链接：https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-ii/

和上面一题有点不一样 因为可以多次交易 所以就不是-prices[i]了

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