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

Note:
You can assume that you can always reach the last index.

分析

一个神奇的题
最开始以为是dp

public static int jump1(int[] nums) {
        int[] dp = new int[nums.length];
        if (nums.length <= 1) {
            return 0;
        }
        dp[nums.length - 1] = 0;
        for (int i = nums.length - 2; i >= 0; i--) {
            int jump = nums[i];
            int min = Integer.MAX_VALUE - 1;
            for (int j = 1; j <= jump; j++) {
                if (j + i < nums.length) {
                    if (dp[j + i] < min) {
                        min = dp[j+i];
                    }
                } else {
                    break;
                }
            }
            dp[i] = min+1;

        }
        return dp[0];
    }

然而过不了一个超级大的数组。当然这个dp还是有很多可以优化的空间的，比如调整顺序，门限判断，来优化时间。
后来看了大佬的做法，觉得很神奇。

    public int jump(int[] nums) {
        int times = 0;
        int reached = 0;
        int max = 0;
        for(int i=0;i< nums.length;i++){
            if(reached < i){
                times++;
                reached = max;
            }
            max = Math.max(max,i+nums[i]);
        }
        return times;
    }

其实是贪心算法
以确定当前最远能覆盖的节点，放入max。然后继续扫描，直到当前的路程超过了上一次算出的覆盖范围，那么更新覆盖范围，同时更新条数，因为我们是经过了多一跳才能继续前进的。