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.
For example:
A = [2,3,1,1,4], return true.
A = [3,2,1,0,4], return false.
public boolean canJump(int[] nums) {
boolean[] flags = new boolean[nums.length];
flags[0] = true;
int i = 1,j = 0;
for(i = 1;i < nums.length;i++){
flags[i] = false;
for(j = i-1;j >= 0;j--){
if(flags[j] && j + nums[j] >= i){
flags[i] = true;
break;
}
}
}
return flags[nums.length-1];
}
但是下面的代码超时:
public boolean canJump(int[] nums) {
boolean[] flags = new boolean[nums.length];
flags[0] = true;
int i = 1,j = 0;
for(i = 1;i < nums.length;i++){
flags[i] = false;
for(j = 0;j<i;j++){
if(flags[j] && j + nums[j] >= i){
flags[i] = true;
break;
}
}
}
return flags[nums.length-1];
}
区别就在这一行:
for(j = i-1;j >= 0;j–){ OK
for(j = 0;j