题目来源：
https://leetcode.com/problems/jump-game/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.题意分析：
给一个数组，数组中的数字代表从当前位置可以向后移动的最大值，从数组的首位开始，判断能否移动到数组的最后一位
解题思路：
贪心算法：
初始化：设数组最后一位为可以到达数组最后一位的最左边的一位置lastPos。
循环：从数组尾部开始，如果该位置的下标加上它的最大步数大于lastPos，那么它将成为新的lastPos。
结果判断：如果lastPos == 0，那么证明数组位置0可以到达数组的最后一位，返回True，否则返回False
实现代码（Python3）：
class Solution:
def canJump(self, nums):
"""
:type nums: List[int]
:rtype: bool
"""
lastPos = len(nums) - 1
for i in range(len(nums)-1, -1, -1):
if i+nums[i] >= lastPos:
lastPos = i
return lastPos == 0提交结果：
