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

Array Greedy

public class Solution {public int jump(int[] nums) {if(nums == null || nums.length == 0)return 0;int maxCover = 0, lastCover = 0, steps = 0;for(int i = 0; i < nums.length && i <= maxCover; i++){if(i > lastCover){steps++;lastCover = maxCover;}if(i + nums[i] > maxCover)maxCover = i + nums[i];}if(maxCover >= nums.length - 1)                return steps;return 0;}
}

public class Solution {public int jump(int[] nums) {if (nums == null || nums.length == 0) {return Integer.MAX_VALUE;}int maxCover = 0, lastCover = 0, steps = 0;for (int i = 0; i <= maxCover && i < nums.length; i++) {if (i > lastCover) {lastCover = maxCover;steps++;}if (i + nums[i] > maxCover) {maxCover = i + nums[i];}}return maxCover >= nums.length - 1 ? steps : Integer.MAX_VALUE;}
}

public class Solution {public int jump(int[] nums) {if (nums == null || nums.length == 0) return 0;int maxCover = 0, lastCover = 0, steps = 0;for (int i = 0; i < nums.length && i <= maxCover; i++) {if (i > lastCover) {steps++;lastCover = maxCover;}maxCover = Math.max(maxCover, i + nums[i]);}return (maxCover >= nums.length - 1) ? steps : Integer.MAX_VALUE;}
}

public class Solution {public int jump(int[] nums) {if (nums == null || nums.length == 0) return 0;int maxCover = 0, lastCover = 0, steps = 0;for (int i = 0; i < nums.length && i <= maxCover; i++) {if (i > lastCover) {steps++;lastCover = maxCover;}maxCover = Math.max(maxCover, i + nums[i]);if (maxCover >= nums.length - 1) {if (lastCover >= nums.length - 1) return steps;else return steps + 1;}}return Integer.MAX_VALUE;}
}