Jump Game II | Java最短代码实现

public int jump(int[] nums) {
int maxIndex = nums[0];
int preMax = maxIndex;
int minStep = 1;
for (int i = 1; i <= maxIndex && maxIndex < nums.length - 1; i++) {
if (preMax < i) {
minStep++;
preMax = maxIndex;
}
maxIndex = Math.max(maxIndex, nums[i] + i);
}
if (preMax < nums.length - 1) minStep++;  //请读者尝试将这句话注掉，会有什么错误
return nums.length == 1 ? 0 : minStep;
}