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

这题思路是贪心，我这里贴一个discuss上非常简洁的代码，很好理解：

public boolean canJump(int[] nums) {
   int reach=0;
    int i=0;
    for(;i<nums.length&&i<=reach;i++){
        reach=Math.max(i+nums[i],reach);
    }
    return i==nums.length;
}