IntersectionOfTwoArraysII::intersect2() - Code Metrics - Inspection of "Update README.md" - imajinyun/leetcode-php - Measure and Improve Code Quality continuously with Scrutinizer

Test Failed

Push — master ( b4e369...01c2bc )

by Jinyun

created 2021-08-25 08:22 UTC

IntersectionOfTwoArraysII::intersect2() B

↳ Parent: IntersectionOfTwoArraysII

Complexity

Conditions	7
Paths	5

Size

Total Lines	22
Code Lines	16

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

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

<?php

declare(strict_types=1);

namespace leetcode;

class IntersectionOfTwoArraysII
{
    public static function intersect(array $p, array $q): array
    {
        if (empty($p) || empty($q)) {
            return [];
        }
        $ans = $map = [];
        foreach ($p as $v) {
            $map[$v] = ($map[$v] ?? 0) + 1;
        }

        foreach ($q as $v) {
            if (isset($map[$v]) && $map[$v]-- > 0) {
                array_push($ans, $v);
            }
        }
        sort($ans);

        return $ans;
    }

    public static function intersect2(array $p, array $q): array
    {
        if (empty($p) || empty($q)) {
            return [];
        }
        sort($p);
        sort($q);
        [$ans, $m, $n] = [[], count($p), count($q)];
        $i = $j = 0;
        while ($i < $m && $j < $n) {
            if ($p[$i] > $q[$j]) {
                $j++;
            } elseif ($p[$i] < $q[$j]) {
                $i++;
            } else {
                array_push($ans, $p[$i]);
                $i++;
                $j++;
            }
        }

        return $ans;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class IntersectionOfTwoArraysII
8			{
9			public static function intersect(array $p, array $q): array
10			{
11			if (empty($p) \|\| empty($q)) {
12			return [];
13			}
14			$ans = $map = [];
15			foreach ($p as $v) {
16			$map[$v] = ($map[$v] ?? 0) + 1;
17			}
18
19			foreach ($q as $v) {
20			if (isset($map[$v]) && $map[$v]-- > 0) {
21			array_push($ans, $v);
22			}
23			}
24			sort($ans);
25
26			return $ans;
27			}
28
29			public static function intersect2(array $p, array $q): array
30			{
31			if (empty($p) \|\| empty($q)) {
32			return [];
33			}
34			sort($p);
35			sort($q);
36			[$ans, $m, $n] = [[], count($p), count($q)];
37			$i = $j = 0;
38			while ($i < $m && $j < $n) {
39			if ($p[$i] > $q[$j]) {
40			$j++;
41			} elseif ($p[$i] < $q[$j]) {
42			$i++;
43			} else {
44			array_push($ans, $p[$i]);
45			$i++;
46			$j++;
47			}
48			}
49
50			return $ans;
51			}
52			}
53

imajinyun / leetcode-php

Push — master ( b4e369...01c2bc )

IntersectionOfTwoArraysII::intersect2() B

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like