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

MajorityElement::majorityElement() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: MajorityElement

Complexity

Conditions	5
Paths	6

Size

Total Lines	15
Code Lines	9

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	9
c	2
b	0
f	0
dl	0
loc	15
rs	9.6111
cc	5
nc	6
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class MajorityElement
{
    public static function majorityElement(array $nums): int
    {
        [$res, $map, $cnt] = [0, [], count($nums)];
        if (empty($nums)) {
            return $res;
        }
        foreach ($nums as $num) {
            $map[$num] = isset($map[$num]) ? ++$map[$num] : 1;
            if ($map[$num] > $cnt / 2) {
                $res = $num;
                break;
            }
        }

        return $res;
    }

    public static function majorityElement2(array $nums): int
    {
        [$res, $cnt] = [0, 0];
        if (empty($nums)) {
            return $res;
        }
        foreach ($nums as $num) {
            if ($cnt === 0) {
                $res = $num;
            }
            $res === $num ? $cnt++ : $cnt--;
        }

        return $res;
    }

    public static function majorityElement3(array $nums): int
    {
        if (empty($nums)) {
            return 0;
        }
        sort($nums);

        return $nums[floor(count($nums) / 2)];
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class MajorityElement
8			{
9			public static function majorityElement(array $nums): int
10			{
11			[$res, $map, $cnt] = [0, [], count($nums)];
12			if (empty($nums)) {
13			return $res;
14			}
15			foreach ($nums as $num) {
16			$map[$num] = isset($map[$num]) ? ++$map[$num] : 1;
17			if ($map[$num] > $cnt / 2) {
18			$res = $num;
19			break;
20			}
21			}
22
23			return $res;
24			}
25
26			public static function majorityElement2(array $nums): int
27			{
28			[$res, $cnt] = [0, 0];
29			if (empty($nums)) {
30			return $res;
31			}
32			foreach ($nums as $num) {
33			if ($cnt === 0) {
34			$res = $num;
35			}
36			$res === $num ? $cnt++ : $cnt--;
37			}
38
39			return $res;
40			}
41
42			public static function majorityElement3(array $nums): int
43			{
44			if (empty($nums)) {
45			return 0;
46			}
47			sort($nums);
48
49			return $nums[floor(count($nums) / 2)];
50			}
51			}
52

imajinyun / leetcode-php

MajorityElement::majorityElement() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

MajorityElement::majorityElement() A
last analyzed 2022-03-29 06:17 UTC