161. Leetcode 55. 跳跃游戏 (贪心算法-贪心区间)

class Solution:def canJump(self, nums: List[int]) -> bool:if len(nums) == 1:return Truecover = 0i = 0while i <= cover:cover = max(i+nums[i], cover)if cover >= len(nums) - 1:return Truei += 1return False