队列的基本使用:
#include<iostream>
#include<stdio.h>
#include<queue>
using namespace std;
//定义队列,queue<typename> name
queue<int> firstque;
int main(){
//size()返回当前队列元素个数
printf("the size of firstque is: %d\n",firstque.size());
for(int i=0;i<10;i++){
firstque.push(i);//像队列中添加新的元素
}
//
printf("the front of element is: %d\n",firstque.front());//输出头元素0
printf("the back of element is: %d\n",firstque.back());//输出尾元素9
printf("the size of element is:%d\n",firstque.size());//当前队列元素个数(0到9十个)
int sum=0;
while(!firstque.empty()){//empty()返回当前队列是否为空
sum+=firstque.front();//从头元素开始算
firstque.pop();//每循环一此删除一个
}
printf("%d\n",sum);//输出队列内元素相加结果
if(firstque.empty()){
printf("the element is empty\n");
}
printf("the size of firstque is :%d",firstque.empty());
}