deque双端队列容器

  1 # include<deque>
  2 # include<cstdio>
  3 # include<iostream>
  4 using namespace std;
  5 int main(int argc,const char *argv[])
  6 {
  7     /*-----------------------------*/
  8     //插入元素
  9     //deque<int>d;
 10     //d.push_back(1);
 11     //d.push_back(2);
 12     //d.push_back(3);
 13     //cout<<d[0]<<d[1]<<d[2]<<endl;
 14 
 15     /*-------------------------------*/
 16     //从头部插入,将原元素覆盖
 17     //deque<int>d;
 18     //d.push_back(1);
 19     //d.push_back(2);
 20     //d.push_back(3);
 21 
 22     //d.push_front(10);
 23     //d.push_front(20);
 24 
 25     //cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;
 26 
 27     /*-------------------------------------*/
 28     //从中间插入元素，将原元素覆盖
 29     //deque<int>d;
 30     //d.push_back(1);
 31     //d.push_back(2);
 32     //d.push_back(3);
 33     //d.insert(d.begin()+1,88);
 34     //cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;
 35 
 36     /*-------------------------------------*/
 37     //前向遍历
 38     //deque<int>d;
 39     //d.push_back(1);
 40     //d.push_back(2);
 41     //d.push_back(3);
 42     //int i;
 43     //for(i = 0; i < d.size(); i++)
 44     //{
 45     //    cout<<d[i]<<" ";
 46     //}
 47     //cout<<endl;
 48 
 49     /*------------------------------------------*/
 50     //以前向迭代器的方式遍历
 51     //deque<int>d;
 52     //d.push_back(1);
 53     //d.push_back(2);
 54     //d.push_back(3);
 55 
 56     //deque<int>::iterator it;
 57     //for(it = d.begin();it!=d.end();it++)
 58     //{
 59     //    cout<<*it<<" ";
 60     //}
 61 
 62     /*------------------------------------------*/
 63     //反向遍历
 64     //deque<int>d;
 65     //d.push_back(1);
 66     //d.push_back(2);
 67     //d.push_back(3);
 68     //deque<int>::reverse_iterator rit;
 69     //for(rit = d.rbegin(); rit!=d.rend();rit++)
 70     //{
 71     //    cout<<*rit<<endl;
 72     //}
 73 
 74     /*----------------------------------------------*/
 75     //删除元素，采用pop_front()方法从头部删除元素
 76     //deque<int>d;
 77     //d.push_back(1);
 78     //d.push_back(2);
 79     //d.push_back(3);
 80     //d.push_back(4);
 81     //d.push_back(5);
 82 
 83     //d.pop_front();
 84     //d.pop_front();
 85     //deque<int>::iterator it;
 86 
 87     //for(it=d.begin();it!=d.end();it++)
 88     //{
 89     //   cout<<*it<<endl;
 90     //}
 91 
 92     /*-----------------------------------------*/
 93     //采用pop_back()方法从尾部删除元素
 94     //deque<int>d;
 95     //d.push_back(1);
 96     //d.push_back(2);
 97     //d.push_back(3);
 98     //d.push_back(4);
 99     //d.push_back(5);
100 
101     //d.pop_back();
102     //d.pop_back();
103     //deque<int>::iterator it;
104 
105     //for(it=d.begin(); it!=d.end(); it++)
106     // {
107     //    cout<<*it<<endl;
108     //}
109 
110     /*--------------------------------------------*/
111     //使用erase()方法从中间删除元素，
112     //deque<int>d;
113     //d.push_back(1);
114     //d.push_back(2);
115     //d.push_back(3);
116     //d.push_back(4);
117     //d.push_back(5);
118 
119     //d.erase(d.begin()+1);
120     //deque<int>::iterator it;
121 
122     //for(it=d.begin(); it!=d.end(); it++)
123     //{
124     //   cout<<*it<<endl;
125     //}
126 
127     /*-------------------------------------*/
128     deque<int>d;
129     d.push_back(1);
130     d.push_back(2);
131     d.push_back(3);
132     d.push_back(4);
133     d.push_back(5);
134 
135     d.clear();
136     cout<<d.size()<<endl;
137 
138 }
View Code