Given two arrays, write a function to compute their intersection.
Example 1:
Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2]
Example 2:
Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [9,4]
Note:
- Each element in the result must be unique.
- The result can be in any order.
A
class Solution { public: vector<int> intersection(vector<int>& nums1, vector<int>& nums2) { set<int> m1; for(auto v : nums1) { m1.insert(v); } vector<int> res; for(auto v : nums2) { if(m1.find(v) != m1.end()) { auto it = m1.find(v); res.push_back(v); m1.erase(v); } } return res; } };
No comments:
Post a Comment