leetcode 54: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.

思路：

本题可以用贪婪算法来做。不是简单的每次跳对应的数字。

时间复杂度：O(n)

实现如下：

class Solution {
public:
	bool canJump(vector<int>& A) {
		int n = A.size();
		if (n < 2) return true;
		int max_index_can_jump = 0;
		for (int i = 0; i <= max_index_can_jump; ++i)
		{
			if ((A[i] + i) > max_index_can_jump) 
			{
				if ((A[i] + i) >= (n - 1)) return true;
				else max_index_can_jump = A[i] + i; 
			}
		}
		return false;
	}
};

class Solution {
public:
bool canJump(vector<int>A) {
    int i = 0,n=A.size();
    for (int reach = 0; i < n && i <= reach; ++i)
        reach = max(i + A[i], reach);
    return i == n;
}
};