leetcode-----55. 跳跃游戏

代码

class Solution {
public:
    bool canJump(vector<int>& nums) {
        for (int i = 0, j = 0; i < nums.size(); ++i) {
            if (j < i) return false;
            j = max(j, i + nums[i]);
        }
        return true;
    }
};
原文地址:https://www.cnblogs.com/clown9804/p/13257862.html