349 Intersection of Two Arrays
来源:互联网 发布:国内外大数据现状分析 编辑:程序博客网 时间:2024/06/06 12:22
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.
class Solution {public: vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { unordered_set<int> m(nums1.begin(), nums1.end()); vector<int> res; for (auto a : nums2) if (m.count(a)) { res.push_back(a); m.erase(a); } return res; }};
用两个hash表进行查找即可。
阅读全文
0 0
- [349]Intersection of Two Arrays
- 349 Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Intersection of two arrays
- Intersection of Two Arrays
- Intersection of Two Arrays
- Angularjs2
- 关于实现线程死锁的一个例子
- 用shell脚本语言实现一个斐波那契数列的递归和非递归版本
- 求<=N的平方数
- 日期推算
- 349 Intersection of Two Arrays
- java8 lambda 使用 与 functional interface 与 function 类
- 【MongoDB】explain & hint
- 1_单一职责原则
- SSH Unit01
- Kimbal Musk 介绍:埃隆马斯克的弟弟
- Scrapy学习笔记 妹子图
- 399 Evaluate Division
- [树形DP] 猴腮雷 (没有上司的舞会)