[求助]关于queue的问题
身边没有数据结构的书,以前看过没怎么用,也就忘记了,请帮忙给出queue对象的操作算子及其用法,总之就是队列的几个功能,比如back等等,谢谢帮忙写下~!
#include
<iostream>#include
<string>#include
<deque>using
namespace std;int
main(int argc, char* argv[]){
deque<string> queString;
queString.push_back("#no1");
queString.push_back("#no2");
queString.push_front("#no0");
queString.push_front("#no-1");
while (queString.size()){
cout << queString.back() << endl;
queString.pop_back();
}
return 0;}