Runtime: 65 ms (Top 73.60%) | Memory: 14 MB (Top 91.27%)

Author: AnasImloul

scripts/algorithms/I/Intersection of Two Arrays/Intersection of Two Arrays.py

@@ -1,3 +1,4 @@
+# Runtime: 65 ms (Top 73.60%) | Memory: 14 MB (Top 91.27%)
 class Solution:
     def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
         nums1.sort()
@@ -14,4 +15,4 @@ def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
                     ans.append(nums1[i])
                 i += 1
                 j += 1
-        return ans
+        return ans