[LeetCode]intersection of two arrays 2 (완료)

[yeonghwanjeon]

• 문제 링크

• 문제 풀이

  • Counting sort 개념 활용

    class Solution(object):
    def intersect(self, nums1, nums2):
    """
    :type nums1: List[int]
    :type nums2: List[int]
    :rtype: List[int]
    """
    if len(nums1) > len(nums2) :
        nums1, nums2 = nums1, nums2
    
    n2_dict = {}
    for n2 in nums2 :
        if n2 in n2_dict :
            n2_dict[n2] += 1
        else :
            n2_dict[n2] = 1
    
    result = []
    for n1 in nums1 :
        if n1 in n2_dict and n2_dict[n1] > 0 :
            result.append(n1)
            n2_dict[n1] = n2_dict[n1] - 1
    
    return result