STL入门知识（deque）

头文件

#include<deque>

常用操作

下面通过代码展示双端队列容器的常用操作

#include <iostream>
#include <deque>
using namespace std;
template <class T>
void print(T&deq,char *str)
{
	typename T::iterator it;
	cout<<"The elements of "<<str<<": ";
	for(it=deq.begin();it!=deq.end();it++)
	{
		cout << *it<<" ";
	} 
	cout<<endl;
}
int main()
{
	deque<char>deque_A; //创建双端队列
	deque_A.push_back('c');
	deque_A.push_back('d');
	
	deque_A.push_front('b');
	deque_A.push_front('a');
	print(deque_A,"deque_A");
	
	//显示队头元素
	cout<<"The first element of deque_A is "<< deque_A.front()<<endl;
	//显示队尾元素
	cout<<"The last element of deque_A is " <<deque_A.back()<<endl;
	//在队尾插入元素
	deque_A.insert(deque_A.end(),'x');
	//在队头插入元素
	deque_A.insert(deque_A.begin(),'z');
	print(deque_A,"deque_A");
	//在队头出队列
	deque_A.pop_front();
	//在队尾出队列
	deque_A.pop_back();
	print(deque_A,"deque_A");
	return 0; 
}

其他操作

//判断容器是否为空
bool isEmpty = deque_A.empty();
//获取容器大小
int size = deque_A.size();