Jump game ii

class Solution {
public:
    int jump(int A[], int n) {
        
        if (n <= 1) return 0;
        
        int maxReachedLastTime = 0;
        int maxReachedNow = 0;
        int minSteps = 0;
        
        for (int index = 0; index<n; index++){
            
            if (index > maxReachedLastTime){
                
                maxReachedLastTime = maxReachedNow;
                minSteps++;
            } 
            
            if (index+A[index]>maxReachedNow) maxReachedNow = index+A[index];
        }
        
        return minSteps;
    }
};