常用集合算法

10.1	set_intersection算法 求两个set集合的交集
10.2	set_union算法 求两个set集合的并集
10.3	set_difference算法 求两个set集合的差集

set_intersection

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());

	copy(vTarget.begin(), itEnd, ostream_iterator<int>(cout, " "));
	cout << endl;
}

必须是有序序列

set_union

void test02() {
	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());

	copy(vTarget.begin(), itEnd, ostream_iterator<int>(cout, " "));
	cout << endl;
}

set_difference

void test03() {
	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());

	//v1差v2
	vector<int>::iterator itEnd = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), vTarget.begin());
	copy(vTarget.begin(), itEnd, ostream_iterator<int>(cout, " "));
	cout << endl << endl;

	vector<int>::iterator itEnd2 = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), vTarget.begin());
	copy(vTarget.begin(), itEnd2, ostream_iterator<int>(cout, " "));
	cout << endl;
}