LargestUniqueNumber::largestUniqueNumber2() - Code Metrics - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

LargestUniqueNumber::largestUniqueNumber2() B
last analyzed 2022-03-29 06:17 UTC

↳ Parent: LargestUniqueNumber

Complexity

Conditions	7
Paths	16

Size

Total Lines	22
Code Lines	15

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
eloc	15
c	1
b	0
f	0
dl	0
loc	22
rs	8.8333
cc	7
nc	16
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class LargestUniqueNumber
{
    public static function largestUniqueNumber(array $nums): int
    {
        if (empty($nums)) {
            return -1;
        }
        $n = count($nums);
        if ($n === 1) {
            return $nums[0];
        }
        sort($nums);
        if ($nums[$n - 1] !== $nums[$n - 2]) {
            return $nums[$n - 1];
        }
        for ($i = $n - 2; $i > 0; $i--) {
            [$prev, $curr, $next] = [$nums[$i - 1], $nums[$i], $nums[$i + 1]];
            if ($prev !== $curr && $curr !== $next) {
                return $curr;
            }
        }

        return $nums[0] !== $nums[1] ? $nums[0] : -1;
    }

    public static function largestUniqueNumber2(array $nums): int
    {
        if (empty($nums)) {
            return -1;
        }
        $n = count($nums);

        [$map, $max, $min] = [[], -1, 1001];
        foreach ($nums as $num) {
            $map[$num] = ($map[$num] ?? 0) + 1;
            $max = $max > $num ? $max : $num;
            $min = $min < $num ? $min : $num;
        }
        [$ans, $tmp] = [-1, $max];
        while ($tmp >= $min) {
            if ($map[$tmp] === 1) {
                $ans = $tmp;
                break;
            }
            $tmp--;
        }

        return $ans;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class LargestUniqueNumber
8			{
9			public static function largestUniqueNumber(array $nums): int
10			{
11			if (empty($nums)) {
12			return -1;
13			}
14			$n = count($nums);
15			if ($n === 1) {
16			return $nums[0];
17			}
18			sort($nums);
19			if ($nums[$n - 1] !== $nums[$n - 2]) {
20			return $nums[$n - 1];
21			}
22			for ($i = $n - 2; $i > 0; $i--) {
23			[$prev, $curr, $next] = [$nums[$i - 1], $nums[$i], $nums[$i + 1]];
24			if ($prev !== $curr && $curr !== $next) {
25			return $curr;
26			}
27			}
28
29			return $nums[0] !== $nums[1] ? $nums[0] : -1;
30			}
31
32			public static function largestUniqueNumber2(array $nums): int
33			{
34			if (empty($nums)) {
35			return -1;
36			}
37			$n = count($nums);
			0 ignored issues – show Unused Code introduced 2021-06-01 12:59 UTC by Report Bug Copy Issue Report The assignment to `$n` is dead and can be removed. Loading history...
38			[$map, $max, $min] = [[], -1, 1001];
39			foreach ($nums as $num) {
40			$map[$num] = ($map[$num] ?? 0) + 1;
41			$max = $max > $num ? $max : $num;
42			$min = $min < $num ? $min : $num;
43			}
44			[$ans, $tmp] = [-1, $max];
45			while ($tmp >= $min) {
46			if ($map[$tmp] === 1) {
47			$ans = $tmp;
48			break;
49			}
50			$tmp--;
51			}
52
53			return $ans;
54			}
55			}
56

imajinyun / leetcode-php

LargestUniqueNumber::largestUniqueNumber2() B last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

LargestUniqueNumber::largestUniqueNumber2() B
last analyzed 2022-03-29 06:17 UTC