55. Jump Game

55. Jump Game

Medium

6081418Add to ListShare

Given an array of non-negative integers nums, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if you are able to reach the last index.

 

Example 1:

Input: nums = [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: nums = [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.

 

Constraints:

• 1 <= nums.length <= 3 * 104
• 0 <= nums[i] <= 105

class Solution:
    def canJump(self, nums: List[int]) -> bool:
        """
        解题思路：先做的[45Jump Game II]，求的是到终点的最小步数。方法通用，
        即从左枚举每个数，标记能走的最远距离，若当前位置是之前标记能到的最远距离，则重置最远距离为0
        时间复杂度：O(n)
        空间复杂度：O(1)
        """
        if nums is None or len(nums) <= 1:
            return True
        farthest = 0
        for i in range(len(nums) - 1):
            if i > farthest:
                # 当前位置是之前最远距离到达不了的
                return False
            if i < farthest:
                # 更新能走的最远距离
                farthest = max(farthest, i + nums[i])
            else:
                # 当前位置是之前能走的最远距离
                farthest = i + nums[i]
            if farthest >= len(nums) - 1:
                return True
        return False