STL set之求交并差

来源:互联网 发布:雅思写作小作文 知乎 编辑:程序博客网 时间:2024/04/16 19:00
#include <iostream>#include <set>#include <string>#include <algorithm>using namespace std;struct compare{bool operator ()(string s1,string s2){return s1>s2;}///自定义一个仿函数};int main(){typedef std::set<string,compare> _SET;_SET s;s.insert(string("sfdsfd"));s.insert(string("apple"));s.insert(string("english"));s.insert(string("dstd"));cout<<"s1:"<<endl;std::set<string,compare>::iterator it = s.begin();while(it!=s.end())cout<<*it++<<" ";cout<<endl<<"s2:"<<endl;_SET s2;s2.insert(string("abc"));s2.insert(string("apple"));s2.insert(string("english"));it = s2.begin();while(it!=s2.end())cout<<*it++<<" ";cout<<endl<<endl;string str[10];string *end = set_intersection(s.begin(),s.end(),s2.begin(),s2.end(),str,compare());//求交集,返回值指向str最后一个元素的尾端cout<<"result of set_intersection s1,s2:"<<endl;string *first = str;while(first<end)cout <<*first++<<" ";cout<<endl<<endl<<"result of set_union of s1,s2"<<endl;end = std::set_union(s.begin(),s.end(),s2.begin(),s2.end(),str,compare());//并集 first = str;while(first<end)cout <<*first++<<" ";cout<<endl<<endl<<"result of set_difference of s2 relative to s1"<<endl;first = str;end = std::set_difference(s.begin(),s.end(),s2.begin(),s2.end(),str,compare());//s2相对于s1的差集 while(first<end)cout <<*first++<<" ";cout<<endl<<endl<<"result of set_difference of s1 relative to s2"<<endl;first = str;end = std::set_difference(s2.begin(),s2.end(),s.begin(),s.end(),str,compare());//s1相对于s2的差集while(first<end)cout <<*first++<<" ";cout<<endl<<endl;first = str;end = std::set_symmetric_difference(s.begin(),s.end(),s2.begin(),s2.end(),str,compare());//上面两个差集的并集 while(first<end)cout <<*first++<<" ";cout<<endl;}

运行结果:


http://www.cnblogs.com/zhangchaoyang/articles/2026096.html

0 0
原创粉丝点击