题目:
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.
For example:
Given array A = [2,3,1,1,4]
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.)
思路:首先想到的就是BFS。一层一层遍历,一旦reach末尾,返回遍历的层数。然后用Queue实现BFS。算法结果没问题,就是时间复杂度太高。
后来看了leetcode上面解法,优化了自己的BFS,时间复杂度也降到了O(n)。
记录每一步能jump到的最远距离nums[i]+i
举个栗子:2 3 1 1 4
从2开始jump,能到到的最远距离是2,经过元素3和1;然后计算第二跳,能到到达的最大距离:3+1=4 1+2=3,所以第二跳最远距离是4,达到终点,所以返回2
代码:
public int jump(int[] nums) {
int currentMax=0;
int nextMax=0;
int step=0;
int i=0;
while(i<=nums.length-1){
currentMax=nextMax;
if(nextMax>=nums.length-1)
return step;
while(i<=currentMax){
nextMax=Math.max(nextMax, nums[i]+i);
i++;
}
step++;
}
return 0;
}