学步园

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.

贪心去推当前状态最远能到达的位置，最后判断终点。

class Solution {
public:
    bool canJump(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int maxx=0;
        for(int i=0;i<n;++i)
        {
            if(i<=maxx)
            {
                maxx=max(maxx,i+A[i]);
            }
        }
        return maxx>=n-1;
        
    }
};