MaxCounters.java

class Solution {
    public int[] solution(int N, int[] A) {
        int[] result = new int[N];
        int currentMax = 0;
        int max = 0;
        for (int i: A) {
            if (i == N + 1) {
                max = currentMax;
            } else {
                int digit = result[i-1];
                result[i-1] = digit = max > digit ? max + 1 : digit + 1 ;
                if (currentMax < digit) {
                    currentMax = digit;
                }
            }
        }
        for(int i = 0; i < result.length; i++) {
            if(result[i] < max) {
                result[i] = max;
            }
        }
        return result;
    }
}