55. 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.

解析：

从列表的第一个位置开始，数组中的每个元素代表在该位置可以跳跃的最大长度，判断能否到达列表的最后位置。

如果可以到达最后位置，也就是说在列表中间的每一个位置都可以到达后面的位置，所以可以计算我们在列表中可以到达的最大位置。

class Solution:
    def canJump(self, nums):
        """
        :type nums: List[int]
        :rtype: bool
        """
        max_index = 0
        for i in range(len(nums)):
            if i > max_index:         # 判断当前位置是否超出了可到达的最大位置
                return False
            max_index = max(i + nums[i], max_index)   # 更新可到达的最大位置
        return True