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

Subscribe to see which companies asked this question.

  public int jump(int[] nums) {                int n = nums.length;        if(n<=1){            return 0;        }        int count = 0;        int curRh = 0;//从nums[0]跳count次可以到达的最远        int max = 0;//表示目前可以到达的最远距离        for(int i=0;i<n;i++){            /*如果curRh<i,则需要跳一次*/            if(curRh < i){                count++;                curRh = max;            }                        max = Math.max(max,i+nums[i]);        }                return count;            }