[leetcode]349.Intersection of Two Arrays

最新推荐文章于 2025-05-10 15:17:36 发布

weixin_30751947

最新推荐文章于 2025-05-10 15:17:36 发布

阅读量48

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ym65536/p/5515283.html

本文介绍了一种计算两个整数数组交集的算法实现。通过使用哈希表存储第一个数组中的元素，然后遍历第二个数组查找共同元素，并确保结果中每个元素都是唯一的。

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

Solution:

 1 vector<int> intersection(vector<int>& nums1, vector<int>& nums2) 
 2     {
 3         unordered_set<int> htable;
 4         unordered_set<int> htmp;
 5         vector<int> ret;
 6         
 7         for (int i = 0; i < (int)nums1.size(); i++)
 8             htable.insert(nums1[i]);
 9         
10         for (int i = 0; i < (int)nums2.size(); i++)
11             if (htable.find(nums2[i]) != htable.end())
12                 htmp.insert(nums2[i]);
13         
14         for (auto it = htmp.begin(); it != htmp.end(); ++it)
15             ret.push_back(*it);
16         
17         return ret;
18     }