[python][leetcode]Intersection of Two Arrays II

原创 2016年05月30日 12:51:01

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.
Follow up:
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
版权声明:本文为博主原创文章,欢迎转载,但请注明出处

相关文章推荐

leetcode350~Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, 2...

【Leetcode】350. Intersection of Two Arrays II

方法一: 思路: 用flag标记是否nums2中的该元素已经是相交的元素,若不是才加入结果list,并置flag为1然后跳出内层循环继续判断nums1的下一个元素。 public class Solu...

leetcode笔记--Intersection of Two Arrays I & II

Intersection of Two Arrays Given two arrays, write a function to compute their intersection. Example...

【leetcode76】Intersection of Two Arrays II

题目描述:给定两个数组求他们的公共部分,输出形式是数组,相同的元素累计计数例如:nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].原文描述:Given ...

<LeetCode OJ> 349 / 350 Intersection of Two Arrays(I / II)

Total Accepted: 3212 Total Submissions: 6814 Difficulty: Easy Given two arrays, write a functio...

Leetcode Intersection of Two Arrays i,ii查找两个数组的公共元素

主要为什么要选择用set,因为set容器不会出现相同的元素。 /********************************************************************...

[leetcode] 350. Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, ...

[LeetCode] 350. Intersection of Two Arrays II

[LeetCode] 350. Intersection of Two Arrays II 解题思路
  • zhao_tw
  • zhao_tw
  • 2016年10月20日 19:52
  • 93

Leetcode——350. Intersection of Two Arrays II

题目Given two arrays, write a function to compute their intersection.Example: Given nums1 = [1, 2, 2,...

Hold住Leetcode——Intersection of Two Arrays II

Given two arrays, write a function to compute their intersection. Example: Given nums1 = [1, 2, ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[python][leetcode]Intersection of Two Arrays II
举报原因:
原因补充:

(最多只允许输入30个字)