# include <iostream># include <set>using namespace std;/* set(集)-->不重复 multiset(多集) -->允许重复 红黑数(熟读快) 大数据使用方便,自动排序 缺点:插入慢 不能通过find进行修改 *///声明一个函数模板 template <
# include <iostream># include <map># include <string>using namespace std;/* map(映射)-->键不允许重读 multimap(多映射) -->键允许重复 红黑树 自动依靠key排序 基本操作 insert coun
# include <iostream># include <set>using namespace std;//宏定义 typedef set<int> SETINT;int main(){ SETINT a; a.insert(23); a.insert(-1); a.insert(78); a.insert(100);
# include <iostream># include <list>using namespace std; void PrintListContents(const list<int> & listInput);int main(){ list<int> a; a.push_front(4); a.push_front
# include <iostream># include <set>using namespace std;typedef multiset<int> MSETINT;int main(){ MSETINT a; a.insert(67); a.insert(88); a.insert(88); a.insert(123);
# include <iostream># include <stack># include <vector># include <list># include <deque> using namespace std;/* 栈(stack) 后进先出 自适应容器 操作: empry-->
# include <iostream># include <vector># include <list># include <algorithm>using namespace std;//class absInt{// public :// int operator() (int val){//// }//};//与上面的等价struct
# include <iostream># include <queue># include <list># include <deque> using namespace std;/* 队列(queue): 先进先出 定义: queue<int,deque<int> > q;
# include <iostream># include <queue># include <vector># include <deque> using namespace std;/* 优先级队列(priority_queue) 最大值优先级队列,最小值优先级队列 自适应容器 priority_queue
# include <iostream># include <vector># include <string>using namespace std;struct Dog{};int main(){ /* vector动态数组 vector<int> ivec;//ivec是空的 cout<<ivec.s
# include
# include <iostream># include <vector># include <algorithm>using namespace std; template <typename numberType>struct IsMultiple{ numberType m_Divisor;//几的倍数 //构造函数
# include <iostream># include <string># include <algorithm>using namespace std;int main(){ string strSTLString("Hello world"); /* 关于String类型的字符串的输出 */ //1.
# include <iostream># include <vector># include <string>using namespace std;struct Dog{};int main(){ vector<int> ivec; vector<double> dvec; vector<string>
# include <iostream># include <list>using namespace std;void PrintListContents(const list<int> & listInput);int main(){ list<int> a; //在链表前添加数据 a.push_front(10);
# include <iostream># include <deque> # include <algorithm> using namespace std; /* deque是一个动态数组 deque与vector非常类似 deque可以在数组开头和末尾插入和删除数据, vector值可以在末尾添加 */int main(){ de
Copyright © 2005-2023 51CTO.COM 版权所有 京ICP证060544号
