deque双端队列的基本操作

deque双端队列的基本操作

#include <iostream>using namespace std;#include<deque>#include <algorithm>void printD(deque<int> &d){for(deque<int>::iterator it=d.begin();it!=d.end();it++){cout<<*it<<" ";}}//双端数组int main(){deque<int> d1;d1.push_back(1);d1.push_back(3);d1.push_back(5);d1.push_front(-11);d1.push_front(-33);d1.push_front(-55);cout<<"头部元素："<<d1.front()<<endl;cout<<"尾部元素"<<d1.back()<<endl;printD(d1);cout<<endl;d1.pop_front();d1.pop_back();printD(d1);cout<<endl;//查找-33在数组中下标值deque<int>::iterator it=find(d1.begin(),d1.end(),-33);if(it!=d1.end()){cout<<"-33的数组下标："<<distance(d1.begin(),it)<<endl;}else{cout<<"没有找到值为-33的元素"<<endl;}system("pause");return 0;}