学步园

// Virtual.cpp : 定义控制台应用程序的入口点。<br /> //<br /> #include "stdafx.h"<br /> #include <iostream><br /> #include <memory><br /> #include <algorithm><br /> #include <set><br /> #include <map><br /> #include <string><br /> #include <cstdlib><br /> using namespace std;<br /> /*STL中set的一些操作<br /> 作者：blackmanba<br /> 时间：2010年10月6日<br /> */<br /> #define N 10<br /> int main()<br /> {<br /> int arr1[N], arr2[N];<br /> for (int i=0; i<N; i++)<br /> {<br /> arr1[i] = rand()%100;<br /> arr2[i] = rand()%100;<br /> }<br /> set<int> s1(arr1, arr1+N);<br /> set<int> s2(arr2, arr2+N);<br /> set<int> s_i, s_u, s_d, s_sd;<br /> printf("集合1为:/n");<br /> copy(s1.begin(), s1.end(), ostream_iterator<int>(cout, " "));<br /> printf("/n");<br /> printf("集合2为:/n");<br /> copy(s2.begin(), s2.end(), ostream_iterator<int>(cout, " "));<br /> printf("/n");</p> <p> printf("用set的迭代器输出元素/n");<br /> for (set<int>::iterator iter = s2.begin(); iter != s2.end(); iter++)<br /> {<br /> cout<<*iter<<" ";<br /> }<br /> cout<<endl;<br /> //交集<br /> set_intersection(s1.begin(), s1.end(), s2.begin(), s2.end(), inserter(s_i, s_i.begin()));<br /> printf("交集为:/n");<br /> copy(s_i.begin(), s_i.end(), ostream_iterator<int>(cout, " "));<br /> printf("/n");<br /> //并集<br /> set_union(s1.begin(), s1.end(), s2.begin(), s2.end(), inserter(s_u, s_u.begin()));<br /> printf("并集为:/n");<br /> copy(s_u.begin(), s_u.end(), ostream_iterator<int>(cout, " "));<br /> printf("/n");<br /> //差集<br /> set_difference(s1.begin(), s1.end(), s2.begin(), s2.end(), inserter(s_d, s_d.begin()));<br /> printf("差集为:/n");<br /> copy(s_d.begin(), s_d.end(), ostream_iterator<int>(cout, " "));<br /> printf("/n");<br /> //对称差<br /> set_symmetric_difference(s1.begin(), s1.end(), s2.begin(), s2.end(), inserter(s_sd, s_sd.begin()));<br /> printf("对称差为:/n");<br /> copy(s_sd.begin(), s_sd.end(), ostream_iterator<int>(cout, " "));<br /> printf("/n");<br /> /*set的插入操作*/<br /> pair<set<int>::iterator, bool> p;<br /> p = s1.insert(100);<br /> if (p.second == true)<br /> {<br /> cout<<"插入成功!"<<endl;<br /> }<br /> else<br /> {<br /> cout<<*p.first<<"已经在集合中了"<<endl;//注意点运算符(.)比反引用运算符*的优先级高<br /> }<br /> s1.insert(20);<br /> s1.insert(--s1.end(), 50);<br /> s1.insert(s2.begin(), s2.end());</p> <p> /*map操作*/<br /> map<int, string> myMap;<br /> //插入元素的方法<br /> pair<int, string> mypair;<br /> mypair = make_pair(1, "wang");<br /> pair<map<int, string>::iterator, bool> p1 = myMap.insert(mypair);<br /> myMap.insert(pair<int, string>(2, "yang"));</p> <p> myMap[3] = "zhang";</p> <p> myMap.insert(pair<int ,string>(2, "xu"));<br /> /*输出元素*/<br /> for (map<int, string>::iterator iter = myMap.begin(); iter != myMap.end(); ++iter)<br /> {<br /> cout<<(*iter).first<<" "<<(*iter).second<<endl;<br /> }<br /> }