LeetCode 筆記 - 350. Intersection of Two Arrays II

class Solution:
    def intersect(self, nums1: List[int], nums2: List[int]) -> List[int]:
        
        if not nums1 or not nums2:
            return []
        
        nums1.sort()
        nums2.sort()
        
        size1 = len(nums1)
        size2 = len(nums2)
        
        index1 = index2 = 0
        
        result = []
        while index1 < size1 and index2 < size2:
            
            if nums1[index1] < nums2[index2]:
                index1 += 1
                continue
            elif nums1[index1] > nums2[index2]:
                index2 += 1
                continue
            
            result.append(nums1[index1])
            
            index1 += 1
            index2 += 1
            
        return result