kker的博客

保持初心

[python][leetcode]Intersection of Two Arrays II

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
阅读更多
版权声明:本文为博主原创文章,欢迎转载,但请注明出处 https://blog.csdn.net/ghui23/article/details/51537080
文章标签: leetcode python
个人分类: leetcode python
上一篇[python]Intersection of Two Arrays
下一篇python数据结构之列表基本操作[学习笔记]
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭