Leetcode349. Intersection of Two Arrays

链接

link

思路

求两个数组的交集。又想到了字典。依次遍历两个数组即可。找到公共元素,放在新数组里面。

python

class Solution:
    def intersection(self, nums1: List[int], nums2: List[int]) -> List[int]:
        new = []
        visit = {}
        for num in nums1:
            visit[num] = 1
            
        for num in nums2:
            if num in visit:
                new.append(num)
        return list(set(new))
                

javascript

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number[]}
 */
var intersection = function(nums1, nums2) {
    const visit = {};
    const a = []
    for(let i of nums1){
        visit[i] = 1;
    }
    for(let i of nums2){
        if(visit[i] !== undefined){
            a.push(i)
            visit[i] = undefined
        }
    }
    return a
};
发布了74 篇原创文章 · 获赞 4 · 访问量 1455

猜你喜欢

转载自blog.csdn.net/weixin_44814121/article/details/100539697