#include<iostream>
#include<deque>
#include<vector>
#include<stack>
#include<algorithm>
#include<Queue>
#include<ctime>
using namespace std;
//队列 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("A", 1);
Person p2("B", 2);
Person p3("C", 3);
Person p4("D", 4);
//入队
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;
//出队
q.pop();
}
cout << "队列大小为:" << q.size() << endl;
}
int main()
{
test01();
system("pause");
return 0;
}
47&48queue容器-基本概念/常用接口
最新推荐文章于 2024-08-19 16:28:10 发布