LeetCode 55. Jump Game

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.

首先，通过遍历每个点所能到达的下标，是最基本的思路。通过用-1来标记表示通过该点可以到达最后一个位置。

实现如下：

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

在此基础上改进，可以发现，很多点都被重复访问了多次。而理论上其实每个点只需访问一次就能得到答案。于是，尝试设计出一种O(n)的算法。

用reach来表示当前可以到达的最大下标，用current表示当前所在的位置，每次只需要更新reach的值即可。

实现如下：

class Solution {
public:
    bool canJump(vector<int>& nums) {
        int last = nums.size() - 1;
        int current = 0, reach = 0;
        while (current <= last && current <= reach) {
            reach = max(reach, current + nums[current]);
            current++;
        }
        return reach >= last;
    }
};