c++常用集合算法

最新推荐文章于 2024-03-31 20:21:58 发布

我是萌新，大佬带带

最新推荐文章于 2024-03-31 20:21:58 发布

阅读量608

点赞数

分类专栏： c++ 文章标签： c++ 开发语言后端

本文链接：https://blog.csdn.net/qq_52458749/article/details/123327650

版权

c++ 专栏收录该内容

30 篇文章 1 订阅

订阅专栏

set_intersection 交集

#include<iostream>
#include<string>
using namespace std;
#include<vector>
#include<algorithm>
#include<numeric>

/*set_intersection v1,v2必须有序且排序不能相反
vector<int>::iterator itEnd = set_intersection(v.begin(),v.end(),v2.begin(),v2.end(),v3.begin());
//参数列表：1：v1起始迭代器，2：v1结束迭代器，3：v2起始迭代器，4：v2结束迭代器，5：v3起始迭代器，
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};
class Greater10 {
public:
	bool operator()(int& a) {
		return a > 5;
	}
};

void test() {
	vector<int> v,v2,v3;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
		v2.push_back(i + 5);
	}

	v3.resize(min(v.size(),v2.size()));
	
	for_each(v.begin(), v.end(), MyPrint());cout << endl;
	for_each(v2.begin(), v2.end(), MyPrint()); cout << endl;
	
	vector<int>::iterator itEnd = set_intersection(v.begin(),v.end(),v2.begin(),v2.end(),v3.begin());
	for_each(v3.begin(), itEnd, MyPrint()); cout << endl;
}

int main() {
	test();
	return 0;
}

set_union

#include<iostream>
#include<string>
using namespace std;
#include<vector>
#include<algorithm>
#include<numeric>

/*set_union v1,v2必须有序且排序不能相反
vector<int>::iterator itEnd = set_union(v.begin(),v.end(),v2.begin(),v2.end(),v3.begin());
//参数列表：1：v1起始迭代器，2：v1结束迭代器，3：v2起始迭代器，4：v2结束迭代器，5：v3起始迭代器，
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};
class Greater10 {
public:
	bool operator()(int& a) {
		return a > 5;
	}
};

void test() {
	vector<int> v,v2,v3;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
		v2.push_back(i + 5);
	}

	v3.resize(v.size()+v2.size());
	
	for_each(v.begin(), v.end(), MyPrint());cout << endl;
	for_each(v2.begin(), v2.end(), MyPrint()); cout << endl;
	
	vector<int>::iterator itEnd = set_union(v.begin(),v.end(),v2.begin(),v2.end(),v3.begin());
	for_each(v3.begin(), itEnd, MyPrint()); cout << endl;
}

int main() {
	test();
	return 0;
}

set_difference

#include<iostream>
#include<string>
using namespace std;
#include<vector>
#include<algorithm>

/*set_difference v1,v2必须有序且排序不能相反
vector<int>::iterator itEnd = set_difference(v.begin(),v.end(),v2.begin(),v2.end(),v3.begin());
//参数列表：1：v1起始迭代器，2：v1结束迭代器，3：v2起始迭代器，4：v2结束迭代器，5：v3起始迭代器，
*/
class MyPrint {
public:
	void operator()(int& a) {
		cout << a << " ";
	}
};
class Greater10 {
public:
	bool operator()(int& a) {
		return a > 5;
	}
};

void test() {
	vector<int> v,v2,v3;
	for (int i = 0; i < 10; i++)
	{
		v.push_back(i);
		v2.push_back(i + 5);
	}
	v3.resize(max(v.size(),v2.size()));
	
	for_each(v.begin(), v.end(), MyPrint());cout << endl;
	for_each(v2.begin(), v2.end(), MyPrint()); cout << endl;
	
	vector<int>::iterator itEnd = set_difference(v.begin(),v.end(),v2.begin(),v2.end(),v3.begin());
	for_each(v3.begin(), itEnd, MyPrint()); cout << endl;
}

int main() {
	test();
	return 0;
}