deque双端队列容器

# include<deque>
# include<cstdio>
# include<iostream>
using namespace std;
int main(int argc,const char *argv[])
{
    /*-----------------------------*/
    //插入元素
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //cout<<d[0]<<d[1]<<d[2]<<endl;

    /*-------------------------------*/
    //从头部插入,将原元素覆盖
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);

    //d.push_front(10);
    //d.push_front(20);

    //cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;

    /*-------------------------------------*/
    //从中间插入元素，将原元素覆盖
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //d.insert(d.begin()+1,88);
    //cout<<d[0]<<" "<<d[1]<<" "<<d[2]<<endl;

    /*-------------------------------------*/
    //前向遍历
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //int i;
    //for(i = 0; i < d.size(); i++)
    //{
    //    cout<<d[i]<<" ";
    //}
    //cout<<endl;

    /*------------------------------------------*/
    //以前向迭代器的方式遍历
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);

    //deque<int>::iterator it;
    //for(it = d.begin();it!=d.end();it++)
    //{
    //    cout<<*it<<" ";
    //}

    /*------------------------------------------*/
    //反向遍历
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //deque<int>::reverse_iterator rit;
    //for(rit = d.rbegin(); rit!=d.rend();rit++)
    //{
    //    cout<<*rit<<endl;
    //}

    /*----------------------------------------------*/
    //删除元素，采用pop_front()方法从头部删除元素
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //d.push_back(4);
    //d.push_back(5);

    //d.pop_front();
    //d.pop_front();
    //deque<int>::iterator it;

    //for(it=d.begin();it!=d.end();it++)
    //{
    //   cout<<*it<<endl;
    //}

    /*-----------------------------------------*/
    //采用pop_back()方法从尾部删除元素
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //d.push_back(4);
    //d.push_back(5);

    //d.pop_back();
    //d.pop_back();
    //deque<int>::iterator it;

    //for(it=d.begin(); it!=d.end(); it++)
    // {
    //    cout<<*it<<endl;
    //}

    /*--------------------------------------------*/
    //使用erase()方法从中间删除元素，
    //deque<int>d;
    //d.push_back(1);
    //d.push_back(2);
    //d.push_back(3);
    //d.push_back(4);
    //d.push_back(5);

    //d.erase(d.begin()+1);
    //deque<int>::iterator it;

    //for(it=d.begin(); it!=d.end(); it++)
    //{
    //   cout<<*it<<endl;
    //}

    /*-------------------------------------*/
    deque<int>d;
    d.push_back(1);
    d.push_back(2);
    d.push_back(3);
    d.push_back(4);
    d.push_back(5);

    d.clear();
    cout<<d.size()<<endl;

}