Lesson06\EquiLeader::solution()

Complexity

Conditions	8
Paths	12

Size

Total Lines	33
Code Lines	23

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($A)
    {
        $N = count($A);
        if ($N > 1) {
            $count = array_count_values($A);
            arsort($count);
            $max = 0;
            $maxValue = 0;
            foreach ($count as $key => $value) {
                if ($value > (int) ($N / 2)) {
                    $max = $key;
                    $maxValue = $value;
                    break;
                } else {
                    return 0;
                }
            }
            $equiCounter = 0;
            $leftLeader = 0;
            foreach ($A as $key => $value) {
                if ($value == $max) {
                    $leftLeader++;
                }
                if ($leftLeader > ($key + 1) / 2 && ($maxValue - $leftLeader) > ($N - $key - 1) / 2) {
                    $equiCounter++;
                }
            }

            return $equiCounter;
        }

        return 0;
    }
}