45. Jump Game II
题目
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.
解法
记录每跳一步可以跳到的最远位置,然后从上一个位置到最远位置继续记录下一步能跳到的最远位置。
代码
public int jump(int[] nums) {
if(nums.length == 0)
return 0;
int res = 0;
int far = 0;
int last = -1;
while(far < nums.length-1) {
int max = -1;
for(int i = last+1; i <= far; i++) {
max = Math.max(nums[i]+i, max);
}
last = far;
far = max;
res++;
}
return res;
}
执行用时 : 10 ms, 在Jump Game II的Java提交中击败了70.61% 的用户
内存消耗 : 43.1 MB, 在Jump Game II的Java提交中击败了0.70% 的用户