首页 > 代码库 > LeetCode 349. Intersection of Two Arrays
LeetCode 349. Intersection of Two Arrays
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 {public: vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { map<int, int> map; vector<int> ret; for (auto &e : nums1) map[e] = 1; for (auto &e : nums2) { if (map.find(e)!=map.end()&&map[e]==1) { ret.push_back(e); ++map[e]; } } return ret; }};
LeetCode 349. Intersection of Two Arrays
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。