STL常用算法（六）《常用集合》（学习）

最新推荐文章于 2024-06-13 14:57:09 发布

狗狗狗乖乖

最新推荐文章于 2024-06-13 14:57:09 发布

阅读量31

点赞数

分类专栏： C++ 文章标签：学习

本文链接：https://blog.csdn.net/weixin_44273624/article/details/130189235

版权

C++ 专栏收录该内容

32 篇文章 1 订阅

订阅专栏

set_intersection

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
void myprint(int v)
{
	
		cout << v << " ";

}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0;i < 10;i++)
	{
		v1.push_back(i);
		v2.push_back(i + 5);
	}
	vector<int>vtarget;
	vtarget.resize(min(v1.size(), v2.size()));
	vector<int>::iterator itend = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), vtarget.begin());
	for_each(vtarget.begin(), itend, myprint);
}

int main()
{
	test01();
	system("pause");
	return 0;
}

set_union

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
void myprint(int v)
{

	cout << v << " ";

}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0;i < 10;i++)
	{
		v1.push_back(i);
		v2.push_back(i + 5);
	}
	vector<int>vtarget;
	vtarget.resize(v1.size()+v2.size());
	vector<int>::iterator itend = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), vtarget.begin());
	for_each(vtarget.begin(), itend, myprint);
}

int main()
{
	test01();
	system("pause");
	return 0;
}

set_difference

#include<iostream>
using namespace std;
#include<vector>
#include<algorithm>
void myprint(int v)
{

	cout << v << " ";

}
void test01()
{
	vector<int>v1;
	vector<int>v2;
	for (int i = 0;i < 10;i++)
	{
		v1.push_back(i);
		v2.push_back(i + 5);
	}
	vector<int>vtarget;
	vtarget.resize(max(v1.size(),v2.size()));
	vector<int>::iterator itend = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), vtarget.begin());
	for_each(vtarget.begin(), itend, myprint);
}

int main()
{
	test01();
	system("pause");
	return 0;
}