STL：常用集合算法

void print(int val)
{
	cout << val << " ";
}

void test01()
{
	vector<int>v1;
	
	v1.push_back(1);
	v1.push_back(2);
	v1.push_back(2);
	v1.push_back(4);

	vector<int>v2;

	v2.push_back(2);
	v2.push_back(3);
	v2.push_back(4);
	v2.push_back(5);
	v2.push_back(6);


	vector<int>v3;
	v3.resize(min(v1.size(),v2.size()));

	vector<int>::iterator itEnd = set_intersection(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());

	for_each(v3.begin(), itEnd, print);//2 4
	cout << endl;
	
}

注意：两原容器也必须为有序序列，目标容器开辟空间需要从两个容器中取小值
返回值为迭代器，指向交集中最后一个元素位置

void print(int val)
{
	cout << val << " ";
}

void test01()
{
	vector<int>v1;
	
	v1.push_back(1);
	v1.push_back(2);
	v1.push_back(2);
	v1.push_back(4);//2出现两次

	vector<int>v2;

	v2.push_back(2);
	v2.push_back(3);
	v2.push_back(4);
	v2.push_back(5);
	v2.push_back(6);//2出现一次


	vector<int>v3;
	v3.resize(v1.size()+v2.size());

	vector<int>::iterator itEnd = set_union(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());

	for_each(v3.begin(), itEnd, print);//1 2 2 3 4 5 6//最终2出现max(2,1)次
	cout << endl;
	
}

注意：如果某元素在v1中出现n次，在v2中出现m次，最终目标容器中会出现max(m,n)次（《STL源码剖析》）

void print(int val)
{
	cout << val << " ";
}

void test01()
{
	vector<int>v1;
	
	v1.push_back(1);
	v1.push_back(2);
	v1.push_back(2);
	v1.push_back(4);

	vector<int>v2;

	v2.push_back(2);
	v2.push_back(3);
	v2.push_back(4);
	v2.push_back(5);
	v2.push_back(6);


	vector<int>v3;//
	//最特殊情况，两个容器没有交集，取两个容器中最大的size
	v3.resize(max(v1.size(),v2.size()));

	vector<int>::iterator itEnd = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin());//v1 - v2

	for_each(v3.begin(), itEnd, print);//1 2
	cout << endl;

    itEnd = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), v3.begin());//v2 - v1

	for_each(v3.begin(), itEnd, print);//3 5 6
	cout << endl;
	
}

注意：注意：如果某元素在v1中出现n次，在v2中出现m次，最终目标容器中会出现max(n-m,0)次（《STL源码剖析》）