LeetCode——Jump Game

标签：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 JumpGame {
	public boolean canJump(int[] A) {
		int gap=1;
		for(int i=0;i<A.length-1;i++){
			gap--;
			if(A[i] > gap)
				gap = A[i];
			if(gap == 0)
				return false;
		}
		return true;
	}

}

LeetCode——Jump Game

标签：leetcode

原文地址：http://blog.csdn.net/laozhaokun/article/details/41279507