跳跃游戏（贪心）

思路：贪心算法

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

或者这样写也可以：

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