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

121. 买卖股票的最佳时机

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        # _max = 0 
        # _sum = 0
        # i = 1
        # while i < len(prices):
        #     _sum+=prices[i]-prices[i-1]
        #     if _sum <=0:
        #         # i = i+1
        #         _sum =0
        #     i=i+1
        #     _max =max(_max,_sum)
        # return _max
        # 动态规划法
        # dp数组的含义:dp[i][0]为第i天保持持有这只股票的状态 dp[i][1]为第i天保持卖出股票的状态
        # 递推公式： dp[i][0] =max(dp[i-1][0],-prices[i]) dp[i][1] =max(dp[i-1][1],dp[i-1][0]+prices[i])
        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],-prices[i])
            dp[i][1] =max(dp[i-1][1],dp[i-1][0]+prices[i])
        return dp[len(prices)-1][1]

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

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        ## 贪心
        # result = 0 
        # for i in range(len(prices)-1):
        #     if prices[i+1]-prices[i]>0:
        #         result+=prices[i+1]-prices[i]
        # return result
        ## 动规
        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])
        return dp[len(prices)-1][1]