stl--------deque

#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;

int main( int argc,  char ** argv )
{
    deque<int> deq;
    deq.push_back(4);
    deq.push_back(5);
    deq.push_back(6);

    deq.push_front(3);
    deq.push_front(2);
    deq.push_front(1);

    /*
    for( size_t account = 0; account< deq.size(); account++ )
    {
         cout<<deq[account]<<endl;
    }
    */
    deque<int>::iterator itr = deq.begin();
    while( itr != deq.end() )
    {
        size_t nOffset = distance( deq.begin(), itr );
        cout<<"distance:"<<nOffset<<"  ";
        cout<<*itr<<endl;
        itr++;
    }

    return 0;
}

注意：c++迭代器一般是左包右不包