[leetcode]Intersection of Two Arrays

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        result = []
        nums1.sort()
        nums2.sort()
        i = j = 0
        while i < len(nums1) and j < len(nums2):
            if nums1[i] == nums2[j]:
                if nums1[i] not in result:
                    result.append(nums1[i])
                i += 1
            elif nums1[i] < nums2[j]:
                i += 1
            else: # nums1[i] > nums2[j]
                j += 1
                
        return result