leetcode 55 Jump Game

55. Jump Game Medium

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.

Example 1:

Input: [2,3,1,1,4]
Output: true
Explanation: Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2:

Input: [3,2,1,0,4]
Output: false
Explanation: You will always arrive at index 3 no matter what. Its maximum
             jump length is 0, which makes it impossible to reach the last index.

看题目第一眼感觉和53题最大子序列求解很像，不过怎么也写不出来，后来参考其他人的解法，终于通过了，特记录如下：

维护一个最大可达值，遍历数组的每一个元素，

若该元素处的索引大于最大可达值，则不可达；

更新此处的可达值和之前的可达值，取最大为最新的最大可达值；

若全部遍历通过且无返回，则证明该数组末端可达。

//Greedy

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