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.)
Note:
You can assume that you can always reach the last index.
Subscribe to see which companies asked this question.
个人感觉程序是对的,但是编译结果出来了java.lang.StackOverflowError,说是死循环了,无语。
public class Solution {
int min =0;
public int jump(int[] nums) {
int l = nums.length;
for(int i=0; i<l-1; i++){
if(nums[i]>=l-1-i){
min++;
if(i==0){
break;
}
else{
jump(Arrays.copyOfRange(nums, 0, i+1));
break;
}
}
}
return min;
}
}