Intersection of Two Arrays LeetCode solution in Python

1
# Runtime: 65 ms (Top 73.60%) | Memory: 14 MB (Top 91.27%)
2
class Solution:
3
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
4
        nums1.sort()
5
        nums2.sort()
6
        ans = []
7
        i, j = 0, 0
8
        while i < len(nums1) and j < len(nums2):
9
            if nums1[i] < nums2[j]:
10
                i += 1
11
            elif nums1[i] > nums2[j]:
12
                j += 1
13
            else:
14
                if len(ans) == 0 or nums1[i] != ans[-1]:
15
                    ans.append(nums1[i])
16
                i += 1
17
                j += 1
18
        return ans