**LeetCode-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.
For example:
A = [2,3,1,1,4], return true
A = [3,2,1,0,4], return false

Java代码

public class Solution {
    public boolean canJump(int[] nums) {
        int lastPosition = nums.length - 1;
        for (int i = lastPosition; i >= 0 ; i--) {
            if (i + nums[i] >= lastPosition) {
                lastPosition = i;
            }
        }
        return lastPosition == 0;
    }
}

备注：该题题目意思我理解的还有点歧义，等弄明白再解释

参考

LeetCode