#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;
}