349. Intersection of Two Arrays

README.md

@@ -1,6 +1,6 @@
 # LeetCode
 
-## 問題: 
+## 問題: [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/description/)
 
 ## 前提
 

step1.md

@@ -1,4 +1,20 @@
 # Step 1
 
+1. nums1から重複を取り除く
+2. nums2でループを回し、整数がnums1にあったらその数をresに追加、nums1から除外
+
 ```python
+class Solution:
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        res = []
+        nums1_without_duplicates = {num for num in nums1}
+        for num in nums2:
+            if num in nums1_without_duplicates:
+                res.append(num)
+                nums1_without_duplicates.remove(num)
+        return res
+
 ```
+
+時間計算量: O(n)
+空間計算量: O(n)

step2.md

@@ -1,4 +1,13 @@
 # Step 2
 
 ```python
+class Solution:
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        res = []
+        nums1_without_duplicates = set(nums1)
+        for num in nums2:
+            if num in nums1_without_duplicates:
+                res.append(num)
+                nums1_without_duplicates.remove(num)
+        return res
 ```

step3.md

@@ -1,4 +1,13 @@
 # Step 3
 
 ```python
+class Solution:
+    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        res = []
+        nums1_without_duplicates = set(nums1)
+        for num in nums2:
+            if num in nums1_without_duplicates:
+                res.append(num)
+                nums1_without_duplicates.remove(num)
+        return res
 ```