# Leetcode——45. Jump Game II

### 题目原址

https://leetcode.com/problems/jump-game-ii/description/

### 题目描述

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.
Your goal is to reach the last index in the minimum number of jumps.

Example:

Input: [2,3,1,1,4]
Output: 2
Explanation: The minimum number of jumps to reach the last index is 2.
Jump 1 step from index 0 to 1, then 3 steps to the last index.

Note:

You can assume that you can always reach the last index.

### AC代码

class Solution {
public int jump(int[] nums) {
int ret = 0; //返回的步数
int CurMaxReach = 0; //最远能到达的位置
int LastMaxReach = 0; //上一步最远能到达的位置

for(int i = 0; i < nums.length; i++) {
//永远也达不到终点 {3，2，1，0，4}
if(i > CurMaxReach)
return -1;
//当前能到的位置大于上一步最远能达到的位置，所以要更新上一步能到达的位置，并将步数+1
if(i > LastMaxReach) {
LastMaxReach = CurMaxReach;
ret++;
}
//更新最远能到达的位置
CurMaxReach = Math.max(CurMaxReach, i + nums[i]);
}
return ret;
}
}

• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120