前言
c++ STL queue简单用法
常见方法
代码 含义
front() 返回队首元素 O(1)
back() 返回队尾元素 O(1)
push() 尾部添加一个元素副本 进队O(1)
pop() 删除第一个元素 出队 O(1)
size() 返回队列中元素个数,返回值类型unsigned int O(1)
empty() 判断是否为空,队列为空,返回true O(1)
Code
queue
#include<queue>
#include<iostream>
using namespace std;
int main(){
queue<int> que;
cout << "进队: " << endl;
for (int i = 0; i < 5; i++ ){
cout << i << " ";
que.push(i);
}
cout << endl;
cout << "queue size: "<< que.size() << endl;
cout << "出队: " << endl;
for (int i = 0; i < 5; i++ ){
cout << que.front() << " ";
que.pop();
}
cout << endl;
return 0;
}
result
进队:
0 1 2 3 4
queue size: 5
出队:
0 1 2 3 4
数组模拟queue
#include<iostream>
using namespace std;
int main(){
int que[10];
int hh =0; // 队头下标
int tt = -1; // 队尾下标
cout << " 进队:" << endl;
for(int i = 0; i < 5; i++ ){
que[++tt] = i;
cout << que[tt] << " ";
}
cout << endl;
cout << " 出队:" << endl;
for(int i = 0; i < 5; i++ ){
cout << que[hh++] << " ";
}
cout << endl;
}
result
进队:
0 1 2 3 4
出队:
0 1 2 3 4