【第14节 STL容器二】

双向链表

• list

#include <iostream>
#include <list>
#include<string>
using namespace std;

void testList()
{
    
	list<int> iNum;
	list<string> strNum;
	//插入
	strNum.push_back("string1");
	strNum.push_back("string2");
	strNum.push_front("string3");
	//string3 string1 string2
	//遍历
	//不删除方式遍历
	list<string>::iterator iter;
	for (iter = strNum.begin(); iter != strNum.end(); iter++)
	{
    
		cout << *iter << "";
	}
	cout << endl;
	cout << "是否为空：" << boolalpha << !strNum.empty() << endl;
	cout << "元素个数：" << strNum.size() << endl;
	//删除方式遍历
	//string3 string1 string2
	while ( !strNum.empty())
	{
    
		cout << strNum.front() << "";  //back()
		strNum.pop_front();//头部删除 pop_front();
	}
	cout << endl;
	cout << "元素个数：" << strNum.size() << endl;
}

int main()
{
    
	testList();
	return 0;
}

结果

string3string1string2
是否为空：true
元素个数：3
string3string1string2
元素个数：0

栈

• stack

队列

• queue/deque/priority_queue

集合

• set/multiset/bitset