deque的基本操作

#include <iostream>
#include <deque>
using namespace std;

int main(int argc,int **argv){
 deque<int> d;
 d.push_back(1);
 d.push_back(2);
 d.push_back(3);
 d.push_back(4);
 d.push_back(5);

//從頭部插入元素
 //d.push_front(10);
 //d.push_front(20);
 
//從中間插入元素
 //d.insert(d.begin()+1,88);
 //cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;

//前向遍歷(以數組的方式)
 //for (int i = 0; i < d.size();++i)
 // cout<<d[i]<<" ";
 //cout<<endl;

//前向遍歷，以前向迭代器的方式
 //deque<int>::iterator it;
 //for (it = d.begin();it!= d.end();++it)
 // cout<<*it<<" ";
 //cout<<endl;

//反向遍歷
 //deque<int>::reverse_iterator rit;
 //for (rit = d.rbegin();rit!=d.rend();++rit)
 // cout<<*rit<<" ";
 //cout<<endl;

//採用pop_front()方法刪除頭部元素
 //d.pop_front();
 //d.pop_front();
 //deque<int>::iterator it;
 //for (it = d.begin();it!= d.end();++it)
 // cout<<*it<<" ";
 //cout<<endl;

//採用pop_back()方法從尾部刪除元素
 //d.pop_back();
 //deque<int>::iterator it;
 //for (it = d.begin();it!= d.end();++it)
 // cout<<*it<<" ";
 //cout<<endl;

//採用erase()方法釋放中間元素
 d.erase(d.begin()+1);
 deque<int>::iterator it;
 for (it = d.begin();it!= d.end();++it)
  cout<<*it<<" ";
 cout<<endl;
 return 0;
}