jump-game

Posted 2020-09-03 修修55

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

//判断是否能调到结尾。贪心算法。记录每次能跳到的最大距离位置。