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

ContainsDuplicate::containsDuplicate2() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: ContainsDuplicate

Complexity

Conditions	4
Paths	4

Size

Total Lines	13
Code Lines	7

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	7
c	2
b	0
f	0
dl	0
loc	13
rs	10
cc	4
nc	4
nop	1

<?php

declare(strict_types=1);

namespace leetcode;

class ContainsDuplicate
{
    public static function containsDuplicate(array $nums): bool
    {
        if (empty($nums)) {
            return false;
        }
        $n = count($nums);
        for ($i = 0; $i < $n; $i++) {
            for ($j = $i + 1; $j < $n; $j++) {
                if ($nums[$i] === $nums[$j]) {
                    return true;
                }
            }
        }

        return false;
    }

    public static function containsDuplicate2(array $nums): bool
    {
        if (empty($nums)) {
            return false;
        }
        sort($nums);
        for ($i = 1, $n = count($nums); $i < $n; $i++) {
            if ($nums[$i] === $nums[$i - 1]) {
                return true;
            }
        }

        return false;
    }

    public static function containsDuplicate3(array $nums): bool
    {
        if (empty($nums)) {
            return false;
        }
        $map = [];
        foreach ($nums as $key => $num) {
            if (isset($map[$num])) {
                return true;
            }
            $map[$num] = $key;
        }

        return false;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class ContainsDuplicate
8			{
9			public static function containsDuplicate(array $nums): bool
10			{
11			if (empty($nums)) {
12			return false;
13			}
14			$n = count($nums);
15			for ($i = 0; $i < $n; $i++) {
16			for ($j = $i + 1; $j < $n; $j++) {
17			if ($nums[$i] === $nums[$j]) {
18			return true;
19			}
20			}
21			}
22
23			return false;
24			}
25
26			public static function containsDuplicate2(array $nums): bool
27			{
28			if (empty($nums)) {
29			return false;
30			}
31			sort($nums);
32			for ($i = 1, $n = count($nums); $i < $n; $i++) {
33			if ($nums[$i] === $nums[$i - 1]) {
34			return true;
35			}
36			}
37
38			return false;
39			}
40
41			public static function containsDuplicate3(array $nums): bool
42			{
43			if (empty($nums)) {
44			return false;
45			}
46			$map = [];
47			foreach ($nums as $key => $num) {
48			if (isset($map[$num])) {
49			return true;
50			}
51			$map[$num] = $key;
52			}
53
54			return false;
55			}
56			}
57

imajinyun / leetcode-php

ContainsDuplicate::containsDuplicate2() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

ContainsDuplicate::containsDuplicate2() A
last analyzed 2022-03-29 06:17 UTC