Intersection of Two Arrays II LeetCode solution in Python

1
class Solution:
2
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
3
        nums1.sort()
4
        nums2.sort()
5
        ans = []
6
        i, j = 0, 0
7
        while i < len(nums1) and j < len(nums2):
8
            if nums1[i] < nums2[j]:
9
                i += 1
10
            elif nums1[i] > nums2[j]:
11
                j += 1
12
            else:
13
                ans.append(nums1[i])
14
                i += 1
15
                j += 1
16
        return ans