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.

总前已经写过jump gameⅡ 那是是从起始点起依次寻找能到达的最远点  这个虽然也能这么解 但想尝试其他解法 所以没这么做  我想的是从末端开始 寻找最前面的能到达此点的jump点  判断条件是 A[i]>=end-i若没有 则说明无法到达 找到jump点之后 再递归新的end即jump点 注意的是递归的结束条件是A[0]>=end和end=0 代码如下：

 public static boolean canJump(int[] A) {
		return canjump(A, A.length-1);
	}
	public static boolean canjump(int[] A,int end){
		 if(A.length<=1)return true;
		 if(end==0||(A[0]>=end))return true;
		    int newend=end;
			for(int i=end-1;i>=0;i--){
				if(A[i]>=end-i){
				    newend=i;
				}
			}
		    if(newend==end)return false;
		return canjump(A,newend);
	}