leetcode\IntersectionOfTwoArraysII::intersect()

Complexity

Conditions	7
Paths	7

Size

Total Lines	18
Code Lines	10

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

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