LeetCode 045 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.)

代码

---

public class Solution {
    public int jump(int[] A) {
        if(A == null || A.length ==0){
            return 0;
        }
        int n =A.length;
        int[] record = new int[n];
        for(int i=1;i<n;i++){
            record[i]=Integer.MAX_VALUE;
        }
        record[0]=0;
        
        for(int i =0;i<A.length-1;i++){
            int curStep = A[i];
            int j = (curStep+i) <n ? curStep+i : n-1;
            while(j>=1){
                if(record[j]!=Integer.MAX_VALUE){
                    break;
                }
                record[j]= record[i]+1;
                j--;
            }
           
        }
        
        return record[n-1];
    }
}

思路

---

1 能够想到贪婪算法来做，就解决了一半。 第i个点的最少jump数只和之前最早能够到达它的那个点的jump数有关。

2 corner问题比较多。

3 每次计算第i个点能够跳到的点的jump数，如果从小往大计算，会TLE。