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

Analysis: 

public class Solution {
    public int jump(int[] A) {
        if(A.length==0 || A.length==1) return 0;
        
        // maxJumpIndexCurrent: max positions can be reached for the current step
        // maxJumpIndexNext: max positions can be reached for the next step
        // steps: the return value
        int maxJumpIndexCurrent=A[0], maxJumpIndexNext=0, steps=1;
        for(int i=1; i<A.length; i++) {
            // maxJumpIndexNext = { previous_next_max, current_next_max }
            maxJumpIndexNext = Math.max(maxJumpIndexNext, A[i]+i);
            
            // this element is the max position that can be reached based on the current step
            if(maxJumpIndexCurrent==i && i!=A.length-1) {
                maxJumpIndexCurrent = maxJumpIndexNext;
                steps++;
            }
        }
        return steps;
    }
}