From 4a78d79db07f72daee8ef0086830f5b8a947d517 Mon Sep 17 00:00:00 2001
From: nolanzzz <nolanwork131@gmail.com>
Date: Thu, 2 Sep 2021 23:48:46 -0400
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=200349.=E4=B8=A4=E4=B8=AA?=
 =?UTF-8?q?=E6=95=B0=E7=BB=84=E7=9A=84=E4=BA=A4=E9=9B=86=20PHP=E7=89=88?=
 =?UTF-8?q?=E6=9C=AC?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0349.两个数组的交集.md | 29 ++++++++++++++++++++++++++
 1 file changed, 29 insertions(+)

diff --git a/problems/0349.两个数组的交集.md b/problems/0349.两个数组的交集.md
index 752eee51..0cbdf85f 100644
--- a/problems/0349.两个数组的交集.md
+++ b/problems/0349.两个数组的交集.md
@@ -209,6 +209,35 @@ func intersection(_ nums1: [Int], _ nums2: [Int]) -> [Int] {
 }
 ```
 
+PHP:
+```php
+class Solution {
+    /**
+     * @param Integer[] $nums1
+     * @param Integer[] $nums2
+     * @return Integer[]
+     */
+    function intersection($nums1, $nums2) {
+        if (count($nums1) == 0 || count($nums2) == 0) {
+            return [];
+        }
+        $counts = [];
+        $res = [];
+        foreach ($nums1 as $num) {
+            $counts[$num] = 1;
+        }
+        foreach ($nums2 as $num) {
+            if (isset($counts[$num])) {
+                $res[] = $num;
+            }
+            unset($counts[$num]);
+        }
+        
+        return $res;
+    }
+}
+```
+
 ## 相关题目
 
 * 350.两个数组的交集 II