STL库介绍与练习28.pptVIP

printf(Front is %d and Back is %d\n,qu.front(),qu.back()); for(int i=0; i2; ++i){ qu.pop(); printf(Front is %d and Back is %d\n,qu.front(),qu.back()); } for(int i=3; i6; ++i) qu.push(a[i]); printf(The size of queue is %d\n,qu.size()); int n=qu.size(); printf(Front is %d and Back is %d\n,qu.front(),qu.back()); for(int i=0; in-1; ++i){ qu.pop(); printf(Front is %d and Back is %d\n,qu.front(),qu.back()); } system(pause); } queue的使用 输出结果： Front is 1 and Back is 5 Front is 3 and Back is 5 Front is 5 and Back is 5 The size of queu