Given two arrays, write a function to compute their intersection.
Example:
Given nums1 = [1, 2, 2, 1]
, nums2 = [2, 2]
, return [2, 2]
.
Note:
- Each element in the result should appear as many times as it shows in both arrays.
- The result can be in any order.
class Solution(object):
def intersect(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
res=[]
for x in nums1:
if x in nums2:
res.append(x)
nums2.remove(x)
return res
# C = collections.Counter
# return list((C(nums1) & C(nums2)).elements())
def intersect(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
res=[]
for x in nums1:
if x in nums2:
res.append(x)
nums2.remove(x)
return res
# C = collections.Counter
# return list((C(nums1) & C(nums2)).elements())