leetcode\ValidAnagram::isAnagram2()

Complexity

Conditions	7
Paths	16

Size

Total Lines	24
Code Lines	15

Duplication

Lines	0
Ratio	0 %

Importance

Changes	2
Bugs	0	Features	0

<?php
    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;
    }