55. 跳跃游戏

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int len = nums.size(),maxJump =0;
        for(int i =0;i<len;++i){
            if(maxJump<i)
                return false;
            if(i+nums[i]>maxJump){
                maxJump= i+nums[i];
            }
        }
        if(maxJump>=len-1)
            return true;
        else 
            return false;
    }
};