548. 两数组的交集 II

class Solution:
    """
    @param nums1: an integer array
    @param nums2: an integer array
    @return: an integer array
    """
    def intersection(self, nums1, nums2):
        # write your code here
        #排序 + 双指针
        nums1.sort()
        nums2.sort()
        
        results = []
        p1, p2 = 0, 0
        len1, len2 = len(nums1), len(nums2)
        
        while p1 < len1 and p2 < len2:
            if (nums1[p1] == nums2[p2]):
                results.append(nums1[p1])
                p1 += 1 
                p2 += 1 
            elif (nums1[p1] < nums2[p2]):
                p1 += 1 
            elif (nums1[p1] > nums2[p2]):
                p2 += 1 
            
        return results