题目链接

https://leetcode.cn/problems/jump-game/

代码

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