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

ValidAnagram::isAnagram() A
last analyzed 2022-03-29 06:17 UTC

↳ Parent: ValidAnagram

Complexity

Conditions	4
Paths	5

Size

Total Lines	17
Code Lines	11

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

Metric	Value
eloc	11
c	2
b	0
f	0
dl	0
loc	17
rs	9.9
cc	4
nc	5
nop	2

<?php

declare(strict_types=1);

namespace leetcode;

class ValidAnagram
{
    public static function isAnagram(string $s, string $t): bool
    {
        [$m, $n] = [strlen($s), strlen($t)];
        if ($m !== $n) {
            return false;
        }
        $source = $target = [];
        for ($i = 0; $i < $m; $i++) {
            $source[] = $s[$i];
        }
        for ($i = 0; $i < $n; $i++) {
            $target[] = $t[$i];
        }
        sort($source);
        sort($target);

        return $source === $target;
    }

    public static function isAnagram2(string $s, string $t): bool
    {
        [$m, $n] = [strlen($s), strlen($t)];
        if ($m !== $n) {
            return false;
        }
        $map = array_fill(0, 26, 0);
        for ($i = 0; $i < $m; $i++) {
            $key = ord($s[$i]) - ord('a');
            if (isset($map[$key])) {
                $map[$key]++;
            }
        }
        for ($i = 0; $i < $n; $i++) {
            $key = ord($t[$i]) - ord('a');
            if (isset($map[$key])) {
                $map[$key]--;
            }
            if ($map[$key] < 0) {
                return false;
            }
        }

        return true;
    }
}


1			<?php
2
3			declare(strict_types=1);
4
5			namespace leetcode;
6
7			class ValidAnagram
8			{
9			public static function isAnagram(string $s, string $t): bool
10			{
11			[$m, $n] = [strlen($s), strlen($t)];
12			if ($m !== $n) {
13			return false;
14			}
15			$source = $target = [];
16			for ($i = 0; $i < $m; $i++) {
17			$source[] = $s[$i];
18			}
19			for ($i = 0; $i < $n; $i++) {
20			$target[] = $t[$i];
21			}
22			sort($source);
23			sort($target);
24
25			return $source === $target;
26			}
27
28			public static function isAnagram2(string $s, string $t): bool
29			{
30			[$m, $n] = [strlen($s), strlen($t)];
31			if ($m !== $n) {
32			return false;
33			}
34			$map = array_fill(0, 26, 0);
35			for ($i = 0; $i < $m; $i++) {
36			$key = ord($s[$i]) - ord('a');
37			if (isset($map[$key])) {
38			$map[$key]++;
39			}
40			}
41			for ($i = 0; $i < $n; $i++) {
42			$key = ord($t[$i]) - ord('a');
43			if (isset($map[$key])) {
44			$map[$key]--;
45			}
46			if ($map[$key] < 0) {
47			return false;
48			}
49			}
50
51			return true;
52			}
53			}
54

imajinyun / leetcode-php

ValidAnagram::isAnagram() A last analyzed 2022-03-29 06:17 UTC

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

ValidAnagram::isAnagram() A
last analyzed 2022-03-29 06:17 UTC