c++ deque使用

int _tmain(int argc, _TCHAR* argv[])
{
//estimate(5,betsy);
// estimate(5,pam);


deque<int> deq(20); //创建一个20个元素的双端队列
deque<int>::iterator pos;
int i;
for ( i = 0; i < 20; i++)
{
deq[i] = i;
}
/*for(i = 0; i < 20;++i)
{
cout << deq[i] << endl;
}*/




deq.push_front(200);//在头插入
deq.push_back(i);//在尾插入
for(pos =deq.begin();pos!=deq.end();pos++)
{
cout << *pos  << "  " ;
}
cout << endl;
const int FINDNUMER = 19;
pos = find(deq.begin(),deq.end(),FINDNUMER);
if(pos != deq.end())
{
cout << "find success!" << *pos << endl;
}
else
{
cout << "find failed!" << endl;
}


deq.pop_back();
deq.pop_front();
deque<int> deq2(20);
deq2.swap(deq);
for(pos = deq2.begin();pos != deq2.end();pos++)
{
cout << *pos  << "  " ;
}
cout << endl;



cout << "deq最大数据的数据" << deq.max_size() << endl;


cout << "deq2最大数据的数据" << deq2.max_size() << endl;






return 0;
}