算法简介:
注意:两个集合必须是有序序列且为升序列
功能描述: 求两个容器的交集
注意:两个集合必须是有序序列且为升序列
函数原型:
set_intersection(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest); //求两个集合的交集
示例:
//交集
void test01() {
vector v1;
vector v2;
for (int i = 0; i < 5; i++)
{
v1.push_back(i+8);
v2.push_back(i+10);
}
cout << "v1: ";
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
cout << "v2: ";
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
vector tagerV;
//提前开辟空间,取两者中最小的一个容器大小
tagerV.resize(min(v1.size(), v2.size()));
//取交集
vector::iterator itEnd = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), tagerV.begin());
//打印输出交集
cout << "交集: ";
for_each(tagerV.begin(), itEnd, myPrint());
cout << endl;
}
功能描述: 求两个集合的并集
注意:两个集合必须是有序序列且为升序列
函数原型:
set-union(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest) //求两个集合的并集
示例:
//并集
void test02() {
cout << "-------------------------------------" << endl;
vector v1;
vector v2;
for (int i = 0; i < 5; i++)
{
v1.push_back(i + 8);
v2.push_back(i + 10);
}
cout << "v1: ";
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
cout << "v2: ";
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
vector tagerV;
//提前开辟空间,取两者容器之和
tagerV.resize(v1.size()+v2.size());
//取并集
vector::iterator itEnd = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), tagerV.begin());
//打印输出并集
cout << "并集: ";
for_each(tagerV.begin(), itEnd, myPrint());
cout << endl;
}
功能描述: 求两个集合的差集
注意:两个集合必须是有序序列且为升序列
函数原型:
set-difference(iterator beg1, iterator end1, iterator beg2, iterator end2, iterator dest); //求两个集合的差集(结果为容器1中容器2没有的)
示例:
//差集
void test03() {
cout << "-------------------------------------" << endl;
vector v1;
vector v2;
for (int i = 0; i < 5; i++)
{
v1.push_back(i + 8);
v2.push_back(i + 10);
}
cout << "v1: ";
for_each(v1.begin(), v1.end(), myPrint());
cout << endl;
cout << "v2: ";
for_each(v2.begin(), v2.end(), myPrint());
cout << endl;
vector tagerV;
//提前开辟空间,取两者容器之中最大的一个
tagerV.resize(max(v1.size(), v2.size()));
//取差集
vector::iterator itEnd = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), tagerV.begin());
//打印输出差集
cout << "差集: ";
for_each(tagerV.begin(), itEnd, myPrint());
cout << endl;
}
15.6