【LeetCode】55. 跳跃游戏

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

class Solution {
public:
    bool canJump(vector<int>& nums) {
		int n = 0;
		for (auto iter = nums.rbegin(); iter < nums.rend(); iter++) {
			if (*iter >= n)
				if (iter != nums.rend()-1) n = 0;
				else return true;
			n++;
		}
		return false;
    }
};