Lesson05\StoneWall::solution()

Complexity

Conditions	6
Paths	5

Size

Total Lines	19
Code Lines	13

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

<?php
    public function solution($H)
    {
        $N = count($H);
        $blocks = 0;
        $stack = [];
        $stack_position = 0;
        for ($i = 0; $i < $N; $i++) {
            while ($stack_position > 0 && $stack[$stack_position - 1] > $H[$i]) {
                $stack_position--;
            }
            if (!($stack_position > 0 && $stack[$stack_position - 1] == $H[$i])) {
                $blocks++;
                $stack[$stack_position] = $H[$i];
                $stack_position++;
            }
        }

        return $blocks;
    }
}