deque相关操作

来源：互联网发布：用友t3恢复数据在哪里编辑：程序博客网时间：2024/06/08 17:32
#include <cstdio>#include <cstring>#include <algorithm>#include <deque>#include <iostream>using namespace std;int main(int argc, char *argv[]){deque<int> d;d.push_back(1);//从尾部插入元素; d.push_back(2);d.push_back(3);d.push_back(4);d.push_back(5);cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;cout<<endl;d.push_front(10);//从头部出入元素; d.push_front(20);cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;cout<<endl;d.insert(d.begin()+1,88);//从中间插入元素; cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;cout<<endl;int i;for(i=0;i<d.size();i++)//以数组方式遍历; cout<<d[i]<<" ";cout<<endl<<endl;deque<int>::iterator it;for(it=d.begin();it!=d.end();it++)//以前向迭代器的方式遍历; cout<<*it<<" ";cout<<endl<<endl;deque<int>::reverse_iterator rit;for(rit=d.rbegin();rit!=d.rend();rit++)//以反向迭代器的方式遍历; cout<<*rit<<" ";cout<<endl<<endl;d.pop_front();d.pop_front();//采用pop_front()方式从头部删除元素； deque<int>::iterator sh;for(sh=d.begin();sh!=d.end();sh++)cout<<*sh<<" ";cout<<endl<<endl;d.pop_back();d.pop_back();//采用pop_back()方式从尾部删除元素; deque<int>::iterator ss;for(ss=d.begin();ss!=d.end();ss++)cout<<*ss<<" ";cout<<endl<<endl;d.push_back(4);d.push_back(5);d.push_back(6);d.erase(d.begin()+1,d.begin()+3);//用erase方式从中间删除; deque<int>::iterator sb;for(sb=d.begin();sb!=d.end();sb++)cout<<*sb<<" ";cout<<endl<<endl;d.clear();//清空; cout<<d.size()<<endl;return 0;}
0 0