C++：STL-常用集合算法

#include<iostream>
#include<algorithm>
#include<vector>

using namespace std;


//set_intersection 求两个容器的交集，返回最后一个元素位置
//两个容器必须是有序的
void test01()
{
	vector<int>v1 = { 0,1,2,3,4,5 };
	vector<int>v2 = { 4,5,6,7,8,9 };

	vector<int>v3;
	//提前指定大小
	v3.resize(2);
	//把交集给v3
	set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(),v3.begin());

	for (auto i : v3)
	{
		cout << i << " ";
	}
	cout << endl;
}

//set_union 求两个容器的并集，返回最后一个元素位置
//两个容器必须是有序的
void test02()
{
	vector<int>v1 = { 0,1,2,3,4,5 };
	vector<int>v2 = { 6,7,8,9 };

	vector<int>v3;
	//提前指定大小
	v3.resize(10);
	//两个容器合并给v3
	set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());

	for (auto i : v3)
	{
		cout << i << " ";
	}
	cout << endl;
}

//set_difference 求两个容器的差集，返回最后一个元素位置
//两个容器必须是有序的
void test03()
{
	vector<int>v1 = { 0,1,2,3,4,5 };
	vector<int>v2 = { 4,5,6,7,8,9 };

	vector<int>v3;
	vector<int>v4;
	//提前指定大小
	v3.resize(4);
	v4.resize(4);
	//把v1和v2的差集给v3
	set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());
	//把v2和v1的差集给v4
	set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), v4.begin());

	cout << "v3: " << endl;
	for (auto i : v3)
	{
		cout << i << " ";
	}
	cout << endl;
	cout << "v4: " << endl;
	for (auto i : v4)
	{
		cout << i << " ";
	}
	cout << endl;
}


int main()
{
	test03();

	system("pause");
	return 0;
}