From bbb80d3a6d3245661a34d70aa5d9a508514c589f Mon Sep 17 00:00:00 2001
From: "huangge1199@hotmail.com" <huangge1199>
Date: Sun, 4 Jul 2021 18:11:42 +0800
Subject: [PATCH] =?UTF-8?q?LeetBook--=E5=93=88=E5=B8=8C=E8=A1=A8--?=
 =?UTF-8?q?=E4=B8=A4=E4=B8=AA=E6=95=B0=E7=BB=84=E7=9A=84=E4=BA=A4=E9=9B=86?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../leet/book/hashTablePlus/Intersection.java | 25 +++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 src/main/java/leet/book/hashTablePlus/Intersection.java

diff --git a/src/main/java/leet/book/hashTablePlus/Intersection.java b/src/main/java/leet/book/hashTablePlus/Intersection.java
new file mode 100644
index 0000000..395a90d
--- /dev/null
+++ b/src/main/java/leet/book/hashTablePlus/Intersection.java
@@ -0,0 +1,25 @@
+package leet.book.hashTablePlus;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+public class Intersection {
+    class Solution {
+        public int[] intersection(int[] nums1, int[] nums2) {
+            Set<Integer> set = new HashSet<>();
+            for (int num : nums1) {
+                set.add(num);
+            }
+            int index = 0;
+            for (int num : nums2) {
+                if (set.contains(num)) {
+                    set.remove(num);
+                    nums1[index] = num;
+                    index++;
+                }
+            }
+            return Arrays.copyOf(nums1, index);
+        }
+    }
+}