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:
http://blog.csdn.net/linhuanmars/article/details/21354751
public class Solution {
public boolean canJump(int[] A) {
if(A==null||A.length==0) return false;
int reach=0;
for(int i=0;i<=reach&&i<A.length;i++)//[0,1]会验证为什么要限制i<=reach,想好reach是能跳到的最远位置
{
reach=Math.max(A[i]+i,reach);
}
if(reach<A.length-1)return false;
return true;
}
}