LeetCode力扣之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.)

package leetCode;

/**
 * Created by lxw, liwei4939@126.com on 2018/3/8.
 */
public class L045_Jump_Game {

    public int jump(int[] arr){

        if (arr == null || arr.length == 0){
            return 0;
        }
        int jump = 0; // 目前跳了多少步
        int cur = 0;    // 只跳jump步，最远能够到达的位置
        int next = 0;   // 多跳一步，即jump+ 1 步，最远能够到达的位置

        for (int i = 0; i < arr.length; i++){
            if (cur < i){
                jump ++;
                cur = next;
            }
            next = Math.max(next, i+arr[i]);    //跳jump步，最大位置为cur>= i，即能跳到位置i,
                                                // 假设从i位置，再尝试跳一次是否大于next
        }
        return jump;
    }

    public static void main(String[] args){
        L045_Jump_Game tmp = new L045_Jump_Game();
        int[] arr = new int[]{3, 2, 3, 1, 1, 4};
        System.out.println(tmp.jump(arr));
    }

}