题目：

题解：

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