Lesson06\Dominator::solution()

Complexity

Conditions	4
Paths	4

Size

Total Lines	17
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Importance

Changes

0

<?php
    public function solution($A)
    {
        $N = count($A);
        if ($N) {
            $count = array_count_values($A);
            arsort($count);
            foreach ($count as $key => $value) {
                if ($value <= (int) ($N / 2)) {
                    return -1;
                } else {
                    return array_search($key, $A);
                }
            }
        }

        return -1;
    }
}