leetcode\LargestNumberAtLeastTwiceOfOthers::dominantIndex()

Complexity

Conditions	7
Paths	10

Size

Total Lines	19
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

<?php
    public static function dominantIndex(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        [$index, $n] = [0, count($nums)];
        for ($i = 0; $i < $n; $i++) {
            if ($nums[$i] > $nums[$index]) {
                $index = $i;
            }
        }

        for ($i = 0; $i < $n; $i++) {
            if ($index !== $i && $nums[$index] < 2 * $nums[$i]) {
                return -1;
            }
        }

        return $index;
    }