leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

0350.cpp (388B)

0 class Solution { 1 public: 2 vector<int> intersect(vector<int> &nums1, vector<int> &nums2) { 3 unordered_multiset<int> s(nums1.begin(), nums1.end()); 4 5 vector<int> res; 6 for (int n : nums2) { 7 const auto it = s.find(n); 8 if (it == s.end()) continue; 9 s.erase(it); 10 res.push_back(n); 11 } 12 return res; 13 } 14 };