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], returntrue.

A =[3,2,1,0,4], returnfalse.

 维护一个当前能跳到的最大值maxJump, 若是maxJump 已经>=nums.length-1, 说明能跳到最后一个点，return true.若是过程中maxJump <= i, 说明跳到当前点便不能往前，跳出loop, return false.

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