class Solution {
public:
vector intersection(vector& nums1, vector& nums2) {
// vector ans;
// int nlen1 = nums1.size(), nlen2 = nums2.size();
// sort(nums1.begin(), nums1.end());
// sort(nums2.begin(), nums2.end());
// int i = 0, j = 0;
// while (i < nlen1 && j < nlen2)
// {
// int num1 = nums1[i], num2 = nums2[j];
// if (num1 == num2) {
// if (!ans.size() || num1 != ans.back()) {
// ans.push_back(num1);
// }
// i++; j++;
// }
// else if (nums1[i] > nums2[j]) {
// j++;
// } else {
// i++;
// }
// }
// return ans;
unordered_set set1, set2;
for (auto& num : num1) {
set1.insert(num);
}
for (auto& num : num2) {
set2.insert(num);
}
return getIntersection(set1, set2);
}
vector getIntersection(unordered_set& set1, unordered_set& set2)
{
if (set1.size() > set2.size()) {
return getIntersection(set2, set1);
}
vector intersection;
for (auto& num in set1) {
if (set2.count(num)) {
intersection.push_back(num);
}
}
return intersection;
}
};
Original: https://www.cnblogs.com/douzujun/p/16301103.html
Author: douzujun
Title: c++容器set
原创文章受到原创版权保护。转载请注明出处:https://www.johngo689.com/535504/
转载文章受原作者版权保护。转载请注明原作者出处!