#include <set>
#include <iostream>
//#include <iterator>
#include <algorithm>
#include <string>
using namespace std;
/**
* (20条消息) C++拾取——stl标准库中集合交集、并集、差集、对称差方法_方亮的专栏-CSDN博客_c++ 取交集
* https://blog.csdn.net/breaksoftware/article/details/88932820
*/
int main() {
set<string> a; // { "1", "3", "3", "4", "4", "5", "6" };
a.insert("10.0.0.1");
a.insert("10.0.0.5");
a.insert("10.0.0.6");
a.insert("10.0.0.2");
a.insert("10.0.0.2");
a.insert("10.0.0.4");
a.insert("10.0.0.9");
std::set<string> b; // { "2", "3", "4", "4", "5", "5", "7" };
b.insert("10.0.0.2");
b.insert("10.0.0.5");
b.insert("10.0.0.6");
b.insert("10.0.0.4");
b.insert("10.0.0.7");
cout << "集合a :" << endl;
for (string iter : a) {
cout << iter << endl;
}
cout << "集合b :" << endl;
for (string iter : b) {
cout << iter << endl;
}
std::set<string> result;
//set_difference 需要取差集的两个集合先排序并去掉重复元素。集合初始化后就自动去重排序了
std::set_difference(a.begin(), a.end(), b.begin(), b.end(),
inserter(result, result.begin()));
// std::copy(result.begin(), result.end(),
// ostream_iterator<string>(std::cout, " "));
cout << "集合a 和 b 取差集" << endl;
for (string iter : result) {
cout << iter << endl;
}
return 0;
}
这里需要强调的是在调用set_difference 对两个集合做差集操作前,两个集合一定是去重并且排序了的。这一点很重!不去重或者不排序,都会出现问题。由于set<string>在初始化的时候就已经进行了去重和排序,所以这里没有显示地进行去重排序。如果用vector<string>,则需要我们自己手动添加去重和排序相关代码。详见:
(20条消息) c++ vector<string> 集合做差集_Jerry_liu20080504的专栏-CSDN博客
https://blog.csdn.net/Jerry_liu20080504/article/details/123128417
具体原因:
Equivalent elements are treated individually, that is, if some element is found m times in [first1, last1) and n times in [first2, last2), it will be copied to d_first exactly std::max(m-n, 0) times. The resulting range cannot overlap with either of the input ranges.
参考并感谢以下链接:
(20条消息) C++拾取——stl标准库中集合交集、并集、差集、对称差方法_方亮的专栏-CSDN博客_c++ 取交集
https://blog.csdn.net/breaksoftware/article/details/88932820