LeetCode OJ算法题（五十四）：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 II一样，采用贪心算法，局部最优可以获得全局最优。考虑第n步所能到达的最远距离，一旦跳到了只为0的位置上，直接返回false，因为但凡不能到达数组末尾的案例，一定是局部的最远距离到达了0元素的位置

public class No54_JumpGame {
	public static void main(String[] args){
//		System.out.println(canJump(new int[]{2,3,1,1,4}));
		System.out.println(canJump(new int[]{3,2,1,0,0,4}));
	}
	public static boolean canJump(int[] A) {
		if(A.length == 1) return true;
        int furthest = A[0];
        int start = 0;
        while(furthest < A.length-1){
        	if(A[start] == 0) return false;
        	int end = start + A[start];
        	for(int i=start+1;i<=end;i++){
        		if(i+A[i]>=furthest){
        			furthest = i + A[i];
        			start = i;
        		}
        	}
        }
        return true;
    }
}