LeetCode-Solutions-in-Cpp17

Solutions to high-frequency interview questions of LeetCode in C++17, taking into account both efficiency and comprehensibility.

---

Project maintained by downdemo Hosted on GitHub Pages — Theme by mattgraham

• 用哈希表计数即可

class Solution {
 public:
  vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
    unordered_map<int, int> m;
    for (auto& x : nums1) {
      ++m[x];
    }
    vector<int> res;
    for (auto& x : nums2) {
      if (--m[x] >= 0) {
        res.emplace_back(x);
      }
    }
    return res;
  }
};