第3关：STL模板之关联容器：集合set的操作详解

#include iostream#include cstring#include algorithm#include setusing namespace std;int main(int argc, const char * argv[]) {/********* Begin *********/// 1.创建空的int类型集合setint st;// 2.处理N次插入/删除操作int N;cin N;for(int i0; iN; i){string op;int x;cin op x;if(op insert){// 插入时如果元素已存在输出 x in setif(st.find(x) ! st.end()){cout x in set endl;} else {st.insert(x);}}else if(op erase){// 删除时如果元素不存在输出 x not in setif(st.find(x) st.end()){cout x not in set endl;} else {st.erase(x);}}}// 3.遍历输出集合cout print set: st.size() endl;if(!st.empty()){for(setint::iterator it st.begin(); it ! st.end(); it){if(it ! st.begin()) cout ;cout *it;}}cout endl;// 4.处理M次查找操作int M;cin M;for(int i0; iM; i){string op;int x;cin op x;if(st.find(x) ! st.end()){cout find x in set endl;}else{cout find x not in set endl;}}// 5.清空集合st.clear();/********* End *********/cout st.size() endl;return 0;}