经典算法——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.

Subscribe to see which companies asked this question

class Solution {
public:
	bool canJump(vector<int>& nums) {
		int maxreach = 0;
		for (int i = 0; i<nums.size() && i <= maxreach; ++i)
		{
			maxreach = max(i + nums[i], maxreach);
			if (maxreach >= nums.size() - 1)//当我们知道最远可以达到数组最末尾时，可以直接返回true，而不用遍历整个数组
				return true;
		}
	}
};

经典算法——Jump Game

原文：http://blog.csdn.net/geekmanong/article/details/51093672