队列
用队列所需头文件
#include <queue>
定义队列
queue<type> q
实现队列的操作
q.push(num);
q.pop();
q.front();
q.back();
q.size();
q.empty();
代码
#include <iostream>
#include <queue>
using namespace std;
int main()
{
queue<int> q;
int sum;
cout << "输入的数是:" << endl;
while(cin >>sum)
{
q.push(sum);
}
cout << "输入的数的数目是:" <<q.size()<<endl;
cout << "输出的数是:" << endl;
while(!q.empty())
{
cout << q.front() << " ";
q.pop();
}
cout << endl << "此时在队列里的数的数目是:" << q.size() <<endl;
return 0;
}
注意: 队列里的q.push(num);是压入队列尾。栈里的q.push(num);是压入栈顶。(你四八四入坑了)