https://leetcode.com/problems/intersection-of-two-arrays-ii/

class Solution {
public:
    vector<int> intersect(vector<int>& nums1, vector<int>& nums2) {
        multiset<int> ms(nums1.begin(), nums1.end());
        vector<int> result;
        for (vector<int>::iterator itr=nums2.begin();
             itr != nums2.end();
             ++itr) {
            multiset<int>::iterator mitr = ms.find(*itr);
            if (mitr != ms.end()) {
                result.push_back(*itr);
                ms.erase(mitr);
            }
        }
        return result;
    }
};

 

相关文章:

  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-07-07
  • 2021-05-26
  • 2021-10-03
猜你喜欢
  • 2021-04-12
  • 2021-10-10
  • 2021-06-28
  • 2021-10-04
  • 2021-11-29
  • 2021-07-31
相关资源
相似解决方案