[python]Intersection of Two Arrays

最新推荐文章于 2025-11-21 18:14:39 发布

原创最新推荐文章于 2025-11-21 18:14:39 发布 · 817 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode

python 同时被 2 个专栏收录

13 篇文章

订阅专栏

leetcode

9 篇文章

订阅专栏

本文介绍了一个计算两个数组交集的方法，通过使用字典记录元素出现次数来找出共同元素，并确保结果中每个元素都是唯一的。

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.
Subscribe to see which companies asked this question

class Solution(object):
    def intersection(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]=0
                res.append(num2)
        return res