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

Solution:
Very elegant solution! Sadly, that's not from me :).
Again, we don't record the paths, and don't care about which point that made the furthest distance. Only the furthest distance matters.

public class Solution {
    public int jump(int[] A) {
        if(A.length <= 1) return 0;
        
        int maxDist = A[0];
        int nextMaxDist = maxDist;
        int steps = 1;
        for(int i = 1; i < A.length; i++){
            
            if(i > maxDist){
                maxDist = nextMaxDist;
                steps++;
            }
            
            if(A[i] + i > nextMaxDist){
                nextMaxDist = A[i] + i;
            }
        }
        
        return steps;
    }
}