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.

思路1：贪心法。每次都跳最高的步数，看最后能不能到达或超过最后一个位置是不对的，例如 {2,3,0,2,0,2}会返回false。正确的是维护一个最右端可达的位置变量reach，然后对于reach左边的所有值都要尝试能调到的最远位置，然后利用最远位置更新reach变量。最后看reach能不能达到或者超过最后一个位置。代码如下：

class Solution 
{
public:
    bool canJump(int A[], int n) {
        int reach = 0; //the rightmost reachable position
        for(int i=0; i<=reach && reach<n-1; i++)
            reach = max(reach, i+A[i]);
        return reach >= n-1;
	}
};

思路2：动态规划。参考 http://fisherlei.blogspot.hk/2012/12/leetcode-jump-game.html

class Solution 
{
public:
    bool canJump(int A[], int n) {
        vector<int> f(n, 0);
        f[0] = 0;
        for(int i=1; i<n; ++i)
        {
            f[i] = max(f[i-1], A[i-1]) -1;
            if(f[i] < 0) return false;
        }
        return true;
    }
};