题目链接
https://leetcode.cn/problems/jump-game/
![在这里插入图片描述](https://img-blog.csdnimg.cn/bd7229bd357e4de39a6650e2f2db65b0.png)
代码
class Solution:
def canJump(self, nums: List[int]) -> bool:
if len(nums) <= 1:
return True
cover = 0
for i in range(len(nums)):
if i <= cover:
cover = max(cover, i + nums[i])
if cover >= len(nums) - 1:
return True
return False