1 #include<cstdio> 2 #include<iostream> 3 #include<deque> 4 using namespace std; 5 6 int main() 7 { 8 deque<int>d; 9 for(int i=0;i<5;i++) 10 { 11 d.push_back(i); 12 } 13 deque<int>::iterator ptr; 14 for(ptr=d.begin();ptr!=d.end();ptr++) 15 { 16 cout<<*ptr<<" "; 17 } 18 cout<<endl; 19 cout<<d.front()<<endl; 20 cout<<d.back()<<endl; 21 cout<<d.size()<<endl; 22 cout<<d.max_size()<<endl; 23 cout<<d[1]<<endl; 24 cout<<d.at(1)<<endl; 25 deque<int>d1; 26 d1=d; 27 for(ptr=d1.begin();ptr!=d1.end();ptr++) 28 { 29 cout<<*ptr<<" "; 30 } 31 cout<<endl; 32 d.assign(2,100); //将原来的全部进行删除，重新对d赋值 33 d.pop_back(); //移除最后一个元素 34 d.pop_front(); //移除最前一个元素 35 d.push_back(12); //从最后添加元素 36 d.push_front(34); //从最前添加一个元素 37 d.erase(d.begin()+1); //移除指定位置的元素 38 for(ptr=d.begin();ptr!=d.end();ptr++) 39 { 40 cout<<*ptr<<" "; 41 } 42 cout<<endl; 43 d.insert(d.begin(),100); 44 for(ptr=d.begin();ptr!=d.end();ptr++) 45 { 46 cout<<*ptr<<" "; 47 } 48 d.clear(); 49 d1.clear(); 50 return 0; 51 }