# [python][leetcode]Intersection of Two Arrays II

209人阅读 评论(0)

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.
What if the given array is already sorted? How would you optimize your algorithm?
What if nums1’s size is small compared to num2’s size? Which algorithm is better?
What if elements of nums2 are stored on disk, and the memory is limited such that you cannot load all elements into the memory at once?
Subscribe to see which companies asked this question

class Solution(object):
def intersect(self, nums1, nums2):
"""
:type nums1: List[int]
:type nums2: List[int]
:rtype: List[int]
"""
res=[];diction={}
for num1 in nums1:
if not diction.has_key(num1):
diction[num1]=1
else:
diction[num1]+=1
for num2 in nums2:
if diction.has_key(num2) and diction[num2]>=1:
diction[num2]-=1
res.append(num2)
return res
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：22606次
• 积分：495
• 等级：
• 排名：千里之外
• 原创：24篇
• 转载：23篇
• 译文：0篇
• 评论：3条
评论排行