/*
调用这个算法要使用头文件numeric
accumulate算法 计算容器元素累计总和
//开始 //结束 //从几开始的累加值
accumulate(iterator beg, iterator end, value)
fill算法 向容器中添加元素
//开始 //结束 //填充值
fill(iterator beg, iterator end, value)
求俩个集合的交集差集和并集
差集就是俩个集合去除交集的部分比如A和B去除A和B交集的部分,剩下的A所剩余的区域就是差集的结果
//交集 //目标容器 //目标容器
set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
//并集
//目标容器
set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v4.begin());
//差集
//目标容器
set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v5.begin());
*/
# include <iostream>
# include <numeric>//头文件
# include <algorithm>
# include <list>
# include <map>
# include <set>
# include <stack>
# include <deque>
# include <queue>
# include <functional>
# include <vector>
# include <ctime>
# include <cstdlib>
# include <cmath>
using namespace std;
struct MyPrint01
{
void operator()(int val)
{
cout << val << " ";
}
};
# if 01
void test01()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(9);
v.push_back(3);
int ret = accumulate(v.begin(), v.end(), 0);
cout << ret << endl;
//fill
vector<int> v2;
v2.resize(10);
for_each(v2.begin(), v2.end(), MyPrint01());
cout << endl;
fill(v2.begin(), v2.end(), 10);
for_each(v2.begin(), v2.end(), MyPrint01());
cout << endl;
}
# endif
//三种集合操作
void test02()
{
vector<int> v1;
vector<int> v2;
for(int i = 0; i < 10; i++)
{
v1.push_back(i);
}
for(int i = 5; i < 15; i++)
{
v2.push_back(i);
}
vector<int> v3;
v3.resize(min(v1.size(), v2.size()));
//交集
//返回一个迭代器指向交集的最后的位置
vector<int>::iterator it = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
cout << "it = " << *it << endl;
for_each(v3.begin(), it, MyPrint01());
cout << endl;
//求并集
vector<int> v4;
v4.resize(v1.size() + v2.size());
it = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v4.begin());
for_each(v4.begin(), it, MyPrint01());
cout << endl;
//求差集
vector<int> v5;
v5.resize(v1.size());
it = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v5.begin());
for_each(v5.begin(), it, MyPrint01());
cout << endl;
}
int main(int argc, char *argv[])
{
//test01();
test02();
return 0;
}
调用这个算法要使用头文件numeric
accumulate算法 计算容器元素累计总和
//开始 //结束 //从几开始的累加值
accumulate(iterator beg, iterator end, value)
fill算法 向容器中添加元素
//开始 //结束 //填充值
fill(iterator beg, iterator end, value)
求俩个集合的交集差集和并集
差集就是俩个集合去除交集的部分比如A和B去除A和B交集的部分,剩下的A所剩余的区域就是差集的结果
//交集 //目标容器 //目标容器
set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
//并集
//目标容器
set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v4.begin());
//差集
//目标容器
set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v5.begin());
*/
# include <iostream>
# include <numeric>//头文件
# include <algorithm>
# include <list>
# include <map>
# include <set>
# include <stack>
# include <deque>
# include <queue>
# include <functional>
# include <vector>
# include <ctime>
# include <cstdlib>
# include <cmath>
using namespace std;
struct MyPrint01
{
void operator()(int val)
{
cout << val << " ";
}
};
# if 01
void test01()
{
vector<int> v;
v.push_back(1);
v.push_back(2);
v.push_back(9);
v.push_back(3);
int ret = accumulate(v.begin(), v.end(), 0);
cout << ret << endl;
//fill
vector<int> v2;
v2.resize(10);
for_each(v2.begin(), v2.end(), MyPrint01());
cout << endl;
fill(v2.begin(), v2.end(), 10);
for_each(v2.begin(), v2.end(), MyPrint01());
cout << endl;
}
# endif
//三种集合操作
void test02()
{
vector<int> v1;
vector<int> v2;
for(int i = 0; i < 10; i++)
{
v1.push_back(i);
}
for(int i = 5; i < 15; i++)
{
v2.push_back(i);
}
vector<int> v3;
v3.resize(min(v1.size(), v2.size()));
//交集
//返回一个迭代器指向交集的最后的位置
vector<int>::iterator it = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
cout << "it = " << *it << endl;
for_each(v3.begin(), it, MyPrint01());
cout << endl;
//求并集
vector<int> v4;
v4.resize(v1.size() + v2.size());
it = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v4.begin());
for_each(v4.begin(), it, MyPrint01());
cout << endl;
//求差集
vector<int> v5;
v5.resize(v1.size());
it = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v5.begin());
for_each(v5.begin(), it, MyPrint01());
cout << endl;
}
int main(int argc, char *argv[])
{
//test01();
test02();
return 0;
}