349. Intersection of Two Arrays
Problem:
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.
A possible way:
class Solution { public: vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { set<int> s(nums1.begin(), nums1.end()), res; for (auto a : nums2) { if (s.count(a)) res.insert(a); } return vector<int>(res.begin(), res.end()); } };