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.

在遍历数组的过程中，记录下在每个节点能够到达的最大节点处，如果在遍历的过程中，出现当前的节点不可达(即 i > maxCanReach)，就返回false

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int maxCanReach = 0; 
        int len = nums.size();

        for(int i = 0; i < len; ++i){
            if(i > maxCanReach)    return false;
            maxCanReach = max(maxCanReach, nums[i] + i);
        }
        return true;
    }
};