350.intersection-of-two-arrays-ii

Author: geemaple

README.md

@@ -28,6 +28,7 @@ This is a **continually updated, open source** project.
 | ----------------- | --------------- | --------------- | ------------- |--------------|-----|
 | 88.merge-sorted-array | [python](./algorithm/88.merge-sorted-array.py) | O(N + M) | Easy |
 | 349.intersection-of-two-arrays | [python](./algorithm/349.intersection-of-two-arrays.py) O(N + M) |Easy
+| 350.intersection-of-two-arrays-ii | [python](./algorithm/350.intersection-of-two-arrays-ii.py) O(N * logN) |Easy
 
 ## Two Pointers
 

algorithm/350.intersection-of-two-arrays-ii.py

@@ -0,0 +1,24 @@
+class Solution(object):
+    def intersect(self, nums1, nums2):
+        """
+        :type nums1: List[int]
+        :type nums2: List[int]
+        :rtype: List[int]
+        """
+
+        nums1.sort()
+        nums2.sort()
+        results = []
+        left = 0
+        right = 0
+        while (left < len(nums1) and right < len(nums2)):
+            if nums1[left] == nums2[right]:
+                results.append(nums1[left])
+                left += 1
+                right += 1
+            elif nums1[left] > nums2[right]:
+                right += 1
+            else:
+                left += 1
+
+        return results