LeetCode 45 Jump Game II（按照数组进行移动）

package leetcode_50;


/***
 * 
 * @author pengfei_zheng
 * 给定数组，找出最小跳动选择
 */
public class Solution45 {
    public int jump(int[] nums) {
        if (nums == null || nums.length < 2) {
            return 0;
        }
        int left = 0;
        int right = nums[0];
        int step = 1;
        while (left <= right) {
            if (right >= nums.length - 1) {
                return step;
            }
            int max = Integer.MIN_VALUE;
            for (; left <= right; left++) {
                max = Math.max(max, left + nums[left]);
            }
            if (max > right) {
                left = right;
                right = max;
                step++;
            }
        }
        return -1;
    }
}