[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.

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.

思路：

逆向。定义一个中间节点，用来记录经过该点能够跳至最后一点。初始化这个中间节点为最后一点。从倒数第二点开始，看第二点能不能经过中间点，如果能到中介节点的话，说明从这个点开始是能够跳到终点的。然后就更新中介节点为当前点，继续先前检测下一个点能不能跳到这个中介点，然后以此类推，不断更新中介节点。若果最后中介节点的值是0，即中介节点是第一个点，那么说明可以从第一个点跳转到终点，否则不能。

代码：C++

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int mid = nums.size() - 1;
        for(int i = nums.size() - 2; i >= 0; i--){
            if(mid - i <= nums[i]){
                mid = i;
            }
        }
        if(mid == 0) return true;
        else return false;
    }
};

官方解析：

https://leetcode.com/problems/jump-game/solution/