leetcode-45. Jump Game II

leetcode-45. Jump Game II

题目：

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.

这题没想到怎么做的，尝试了几次都不对，关键是思路不清楚，总是ELT。虽然是肯定是贪婪搜索，但是时间复杂度有限制的。

从最简单的想法来看，就是维护2个nums.length的数组，一个填当前位置可以到达的最远的距离，一个填当前位置的最小跳数。但是这样的话就需要O(n^2)的复杂度（我觉得好像是。因为虽然搜索范围是nums.length*nums[i]但是实际上nums[]的范围是有限的所以应该是n^2）
后来看过答案才明白，应该以每次增长为一个循环层次，然后迭代本次跳跃次数所能跳跃到的最远距离。这样来看的话就简单很多了。这样实际上时间复杂度就是n了

答案来源
重写如下：

public class Solution {
    public int jump(int[] A) {
        int jumps = 0, curEnd = 0, curFarthest = 0;
        for (int i = 0; i < A.length - 1; i++) {
            curFarthest = Math.max(curFarthest, i + A[i]);
            if (i == curEnd) {
                jumps++;
                curEnd = curFarthest;
            }
        }
        return jumps;
    }
}