1.基本概念
queue是一种先进先出的数据结构,有两个出口
2.queue常用接口
#include<iostream>
using namespace std;
#include<string>
#include<vector>
#include<deque>
#include<iterator>
#include<list>
#include<algorithm> //标准算法头文件
#include<numeric>
#include<map>
#include<set>
#include<utility>
#include<fstream>
#include<string>
#include<ctime>
#include<stack>
#include<queue>
class Person {
public:
Person(string name, int age) {
this->m_Name = name;
this->m_Age = age;
}
string m_Name;
int m_Age;
};
void test01() {
queue<Person>q;
Person p1("唐僧", 30);
Person p2("悟空", 1000);
Person p3("猪八戒", 900);
Person p4("沙和尚", 700);
//入队
q.push(p1);
q.push(p2);
q.push(p3);
q.push(p4);
cout << "队列大小为: " << q.size() << endl;
//判断只要队列不为空,查看队头,查看队尾,出队
while (!q.empty()) {
//查看队头
cout << "队头元素--姓名: " << q.front().m_Name << " 年龄: " << q.front().m_Age << endl;
//查看队尾
cout << "队尾元素--姓名: " << q.back().m_Name << " 年龄: " << q.back().m_Age << endl;
cout << endl;
//出队
q.pop();
}
cout << "队列大小为: " << q.size() << endl;
}
int main(int argc,char**argv) {
test01();
system("pause");
return 0;
}
总结:
入队--push
出队--pop
返回队头元素--front
返回队尾元素--back
判断是否为空--empty
返回队列大小--size