[LeetCode] 55. Jump Game

题目内容

https://leetcode-cn.com/problems/jump-game/

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.

给定一个非负整数数组，你最初位于数组的第一个位置。

数组中的每个元素代表你在该位置可以跳跃的最大长度。

判断你是否能够到达最后一个位置。

---

题目思路

依旧是采用动态规划的方法。从左往右到倒数第二个数字进行判定，判定截止到第i个数字，最远可以跳到哪个位置。只要保证在第i个位置和之前至少能跳到i+1位置，那么最终就能够跳到最后一位。

---

程序代码

class Solution(object):
    def canJump(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        if not nums:
            return False
        l=len(nums)
        if l==1:
            return True
        far=0
        for i in range(l-1):
            far=max(far,nums[i]+i)#表示在之前，能够跳到的最远距离
            if far<=i:#在第i个位置时，没法再跳到下一个位置了
                return False
        return True