1.set容器(单集合)
1.数据默认从小到大排序
2.不会存在重复数据
1.集合插入
set<string> ipSet; ipSet.insert("192.168.1.10"); ipSet.insert("192.168.1.2"); ipSet.insert("192.168.1.3"); ipSet.insert("192.168.1.2");
2.输出
set<string>::iterator iter; for (iter = ipSet.begin(); iter != ipSet.end(); iter++) {cout << *iter << endl; } cout << endl;
结果:
2.多重集合
1.默认从小到大排序
2.可以有数据重复
1.多重集合插入
srand((unsigned int)time(NULL)); multiset<int> intSet; for (int i = 0; i < 10; i++) {intSet.insert(rand() % 10); }
2.输出
multiset<int>::iterator mulIter; for (mulIter = intSet.begin(); mulIter != intSet.end(); mulIter++) {cout << *mulIter << " "; } cout << endl;
结果:
3.stack容器(栈)
1.入栈
stack<string> myStack; //入栈 myStack.push("I"); myStack.push("Love"); myStack.push("you");
2.出栈
while (!myStack.empty()) {cout << myStack.top(); //获取栈顶元素myStack.pop(); //出栈 }
4.queue容器(队)
1.入队
//入队 queue<int> intQueue; intQueue.push(1); intQueue.push(2); intQueue.push(3);
2.出队
while (!intQueue.empty()) {cout << intQueue.front(); //获取队头元素intQueue.pop(); //出队 }