代码随想录算法训练营第32天| 122.买卖股票的最佳时机II、55. 跳跃游戏、45.跳跃游戏II

• 今日学习的文章链接，或者视频链接

第八章 贪心算法 part02

• 自己看到题目的第一想法

• 看完代码随想录之后的想法

122:

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        length_prices = len(prices)
        revenue_day = [0] * (length_prices-1)
        for i in range(1,length_prices):
            cha = prices[i] - prices[i-1]
            if cha > 0:
                revenue_day[i-1] = cha
        return sum(revenue_day)

55:

class Solution:
    def canJump(self, nums: List[int]) -> bool:
        cover = 0
        if len(nums) == 1: return True
        i = 0
        # python不支持动态修改for循环中变量,使用while循环代替
        while i <= cover:
            cover = max(i + nums[i], cover)
            if cover >= len(nums) - 1: return True
            i += 1
        return False

45:

class Solution:
    def jump(self, nums: List[int]) -> int:
        if len(nums) == 1:
            return 0
        curDistance, nextDistance = 0, 0
        step = 0
        for i in range(len(nums)-1):
            nextDistance = max(nextDistance, nums[i]+i)
            if i == curDistance:
                curDistance = nextDistance
                step += 1
        return step

• 自己实现过程中遇到哪些困难

• 今日收获，记录一下自己的学习时长