重点是if (nums[j + i]+j+i >=nums[max]+max) max = i + j;这句,比谁能跳的远,而不是比谁位置上的元素大
classSolution{publicintjump(int[] nums){int max =0;int len = nums.length;if(len<=1)return0;int time=0;for(int i =0;i<len;i++){if(nums[i]+i>=len-1)return time+1;
max = i+1;for(int j =1;j<=nums[i];j++){if(nums[j + i]+j+i >=nums[max]+max) max = i + j;}
i=max-1;
time ++;}return time+1;}}