LeetCode 55. Jump Game

题目

思路

维护一个最右index，遍历数组的同时更新最右index即可。

代码

class Solution: def canJump(self, nums): """ :type nums: List[int] :rtype: bool """ right = 0 for i in range(len(nums)): if i <= right: right = max(right, i + nums[i]) return right >= len(nums) - 1