deque双端队列容器前、中、尾部插入

#include <deque>
#include <iostream>


using namespace std;


int main()
{
deque<int> d;


//尾部插入
d.push_back(1);
d.push_back(2);
d.push_back(3);

cout <<d[0] << " "<< d[1] << " "<< d[2] << endl;


//从头部插入，不会增加元素，只会覆盖,而且元素往后移动
d.push_front(10);
d.push_front(20);
cout <<d[0] << " "<< d[1] << " "<< d[2] << endl;


//从中间插入，不会增加元素，只会覆盖,而且元素往后移动
d.insert(d.begin()+1,30);
cout <<d[0] << " "<< d[1] << " "<< d[2] << endl;


cin.get();


return 0;
}