55. Jump Game (Array; Greedy)

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.

思路：在i位置如果能到last index，那么能到达=>局部最优解就是全局最优解=>贪心法。每次求i位置能到达的最远距离。

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

55. Jump Game (Array; Greedy)

原文：http://www.cnblogs.com/qionglouyuyu/p/4924195.html