Lesson02\MaxCounters::solution()

Complexity

Conditions	7
Paths	18

Size

Total Lines	28
Code Lines	19

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public function solution($N, $A)
    {
        $output = array_fill(0, $N, 0);
        $count = count($A);
        $maximum = 0;
        $currentMaximum = 0;
        for ($i = 0; $i < $count; $i++) {
            if ($A[$i] == $N + 1) {
                $maximum = $currentMaximum;
            } else {
                $position = $A[$i] - 1;
                if ($output[$position] < $maximum) {
                    $output[$position] = $maximum;
                }
                $output[$position]++;
                if ($currentMaximum < $output[$position]) {
                    $currentMaximum = $output[$position];
                }
            }
        }
        for ($i = 0; $i < $N; $i++) {
            if ($output[$i] < $maximum) {
                $output[$i] = $maximum;
            }
        }

        return $output;
    }
}