deque双端队列（常用方法总结）

/*关于C++ STL中deque的学习*/ 
#include<cstdio>
#include<iostream>
#include<deque>

using namespace std;
void print(deque<int> d);
void rprint(deque<int> d);
int main()
{
    deque<int> dq;
    dq.push_back(1);
    dq.push_back(2);
    dq.push_back(3);
    dq.push_back(4);
    cout<<dq.size()<<endl;
    cout<<dq[0]<<" "<<dq[1]<<" "<<dq[2]<<" "<<dq[3]<<endl;
    
    dq.push_front(0);
    cout<<dq.size()<<endl;
    cout<<dq[0]<<" "<<dq[1]<<" "<<dq[2]<<" "<<dq[3]<<" "<<dq[4]<<endl;
    
    dq.insert(dq.begin()+2,8);
    cout<<dq.size()<<endl;
    cout<<dq[0]<<" "<<dq[1]<<" "<<dq[2]<<" "<<dq[3]<<" "<<dq[4]<<" "<<dq[5]<<endl;
    
    cout<<"##"<<endl;
    print(dq);
    dq.pop_front();
    print(dq);
    
    print(dq);
    dq.pop_back();
    print(dq);
    
    print(dq);
    dq.clear();
    cout<<"##"<<endl;
    print(dq);
    cout<<"##"<<endl;
    return 0;
}

void print(deque<int> d){
    for(int i=0;i<d.size();i++){
        printf("%d ",d[i]);
    }
    puts("");
}

void rprint(deque<int> d){
    for(int i=d.size()-1;i>=0;i--){
        printf("%d ",d[i]);
    }
    puts("");
}