leetcode\ThirdMaximumNumber

Complexity

Total Complexity

13

Size/Duplication

Total Lines	25
Duplicated Lines	0 %

Importance

Changes	2
Bugs	0	Features	0

1 Method

Rating	Name	Duplication	Size	Complexity
C	thirdMax()	0	23	13

<?php

declare(strict_types=1);

namespace leetcode;

class ThirdMaximumNumber
{
    public static function thirdMax(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        $a = $b = $c = null;
        foreach ($nums as $num) {
            if ($num === $a || $num === $b || $num === $c) {
                continue;
            }
            if ($a === null || $num > $a) {
                $c = $b;
                $b = $a;
                $a = $num;
            } elseif ($b === null || $num > $b) {
                $c = $b;
                $b = $num;
            } elseif ($c === null || $num > $c) {
                $c = $num;
            }
        }

        return $c === null ? $a : $c;

The condition $c === null is always true.

    }
}