解法1：记录每个位置时刻的最大max_reach，先根据max_reach和当前位置i的大小判断是否可达

class Solution: def canJump(self, nums: List[int]) -> bool: n = len(nums) max_reach = 0 for i in range(n): if i > max_reach: return False # 当前位置都不可达 if i + nums[i] > max_reach: max_reach = i + nums[i] if max_reach >= n-1: return True