[LeetCode]Jump Game

标签：java   leetcode   

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.

public class Solution {
    public boolean canJump(int[] A) {
        for(int i=A.length-2;i>=0;i--){
        	if(A[i]==0){
        		boolean oneStep = false;
        		for(int j = i-1;j>=0;j--){
        			if(A[j]+j>i){ 
        				oneStep = true;
        				i = j;
        				break;
        			}
        		}
        		if(!oneStep) return false;
        	}
        }
        return true;
    }
}

[LeetCode]Jump Game

标签：java   leetcode   

原文地址：http://blog.csdn.net/guorudi/article/details/39932527