动规+贪心跳跃,思路是OK的,但是实现上一直有问题,需要多理解
class Solution {
public int jump(int[] nums) {
int ans = 0;
int end = 0;
int maxlen = 0;
for(int i=0; i<nums.length-1; i++){
maxlen = Math.max(maxlen,i+nums[i]);
if(i==end){
end = maxlen;
ans++;
}
}
return ans;
}
}