[easy][Array][two-pointer][hasht

原题：

Given two arrays, write a function to compute their intersection.

Example:
Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].

Note:
Each element in the result must be unique.
The result can be in any order.

思路是：

参见350.

代码是：

class Solution:
    def intersection(self, nums1, nums2):
        """
        :type nums1: List[int]
        :type nums2: List[int]
        :rtype: List[int]
        """
        dicts = {}
        res = []
        
        for i,num in enumerate(nums1):
            if num not in dicts:
                dicts[num] = 1
            else:
                dicts[num] += 1
            
        for j,num in enumerate(nums2):
            if num in dicts:
                res.append(num)
                del dicts[num]
        
        return res