[C++STL]常用集合算法
2021/6/14 12:21:12
本文主要是介绍[C++STL]常用集合算法,对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
代码如下:
#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; class myPrint { public: void operator()(int val) { cout << val << " "; } }; void test01() { vector<int>v1; vector<int>v2; for (int i = 0; i < 10; i++) { v1.push_back(i); v2.push_back(i + 5); } for_each(v1.begin(), v1.end(), myPrint()); cout << endl; for_each(v2.begin(), v2.end(), myPrint()); cout << endl; 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, myPrint()); cout << endl; } int main() { test01(); return 0; }
测试结果:
总结:
代码如下:
#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; class myPrint { public: void operator()(int val) { cout << val << " "; } }; void test01() { vector<int>v1; vector<int>v2; for (int i = 0; i < 10; i++) { v1.push_back(i); v2.push_back(i + 5); } for_each(v1.begin(), v1.end(), myPrint()); cout << endl; for_each(v2.begin(), v2.end(), myPrint()); cout << endl; 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, myPrint()); cout << endl; } int main() { test01(); return 0; }
测试结果:
总结:
代码如下:
#include <iostream> #include <vector> #include <numeric> #include <algorithm> using namespace std; class myPrint { public: void operator()(int val) { cout << val << " "; } }; void test01() { vector<int>v1; vector<int>v2; for (int i = 0; i < 10; i++) { v1.push_back(i); v2.push_back(i + 5); } for_each(v1.begin(), v1.end(), myPrint()); cout << endl; for_each(v2.begin(), v2.end(), myPrint()); cout << endl; vector<int >v3; v3.resize(max(v1.size() , v2.size())); //v1和v2的差集 vector<int>::iterator itEnd = set_difference(v1.begin(), v1.end(), v2.begin(), v2.end(), v3.begin()); for_each(v3.begin(), itEnd, myPrint()); cout << endl; cout << "---------------------------------------" << endl; //v2和v1的差集 vector<int>::iterator itEnd02 = set_difference(v2.begin(), v2.end(), v1.begin(), v1.end(), v3.begin()); for_each(v3.begin(), itEnd02, myPrint()); cout << endl; } int main() { test01(); return 0; }
测试结果:
总结:
这篇关于[C++STL]常用集合算法的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-06-06Package Easy(基于 NSIS 的打包exe安装包工具)使用方法-icode9专业技术文章分享
- 2024-06-06基于 casdoor 的 ELK 开源登录认证解决方案: elk-auth-casdoor-icode9专业技术文章分享
- 2024-05-29Elasticsearch慢查询日志配置
- 2024-05-29揭秘华为如此多成功项目的产品关键——Charter模板
- 2024-05-29海外IDC业务拓展的7大挑战
- 2024-05-29InLine Chat功能优化对标Github Copilot,CodeGeeX带来更高效、更直观的编程体验!
- 2024-05-29CodeGeeX 智能编程助手 6 项功能升级,在Visual Studio插件市场霸榜2周!
- 2024-05-29AutoMQ 生态集成 Apache Doris
- 2024-05-292024年IDC行业的深度挖掘:机遇、挑战与未来展望
- 2024-05-29五款扩展组件齐发 —— Volcano、Keda、Crane-scheduler 等,邀你体验