leetcode 55. Jump Game

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if you are able to reach the last index.

For example:
A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

思路：维护当前位置能向右跳到的最大下标。 每次如果当前位置下标<=这个最大下标时进行更新。

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int n = nums.size();
        int Max = 0;
        for (int i = 0; i < n; ++i) {
            int x = nums[i] + i;
            if (i <= Max) {
                if (x > Max) Max = x;
            }
        }
        return Max >= n-1;
    }
};