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.

分析

给定数组中元素是向前移动最长的步长，判断能否跳到数组的最后位置，最简单的方法是从头开始递归，将当前值所有的可能步长进行检索，判断能否到最后，但此种方法时间复杂度过高，容易超时，参考Linear and simple solution in C++ 的解决方法，设置reach为当前所能到达的最大长度，令i从0开始顺次移动，每次更新reach值，当i移动的索引超出数组最大长度或者超出当前的reach值时，循环结束，如果此时i==n，则能到达最后，否则无法到达。

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