Leetcode 55. Jump Game

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.

解题思路

（1）用一个reach变量记录能到达的最远下标，初始时，reach = 0 + nums[0]；

（2）对每一个在数组范围内能到达的下标，计算从该下标能到达的最远下标，如果大于reach，则更新reach；

（3）重复步骤2，顺序遍历数组，直到遍历完数组或者遍历完在数组范围内能到达的下标；

（4）上述步骤计算出了从每个能到达的下标能到达的最远下标的最大值，即reach，比较reach和数组最后的下标即可。

代码如下：

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