【leetcode】(python) 55. Jump Game跳跃游戏

55. Jump Game Medium

Description

Given an array of non-negative integers, 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: [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: [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.

题意

要求从数组的第一个位置跳到数组的最后一个位置，数组每个位置上的数字是每次可跳跃的最大步数。能到达返回True,否则返回False

贪心算法

开始做这题想用dp动态规划来着，后面发现贪心来得更直接。index表示每次可达到的最大距离，如果索引index<i前面最大距离都到不了该位置，那说明也到不了最后位置。

python code

class Solution:
    def canJump(self, nums: List[int]) -> bool:
        if len(nums)<=1:
            return True
        index = 0
        for i, num in enumerate(nums):
            if i > index:
                return False
            index = max(index,i+num)
        return True

or

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