Queue 队列课程回顾-CSDN博客

本文链接：https://blog.csdn.net/ThisIsHelen/article/details/107544275

这篇博客回顾了队列数据结构的三种类型：Queue（普通队列）、Deque（双端队列）和Priority_queue（优先队列）。Queue遵循FIFO原则，提供了如empty、size、push、pop等操作。Deque允许在两端进行插入和删除，而Priority_queue则是一个FILO的队列，用于处理优先级高的元素。所有这些容器都提供了swap函数来交换内容。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

2020.7.22

Queue

#include <iostream>
#include <queue>
using namespace std;
int main ()
{
    queue <int> q;
    q.push(1);
    q.pop();
    q.front();
    q.back();
    q.size();
    q.empty();
    
    deque<int> dp;
    dp.push_back(1);
    dp.push_front(1);
    dp.front();
    dp.back();
    dp.size();
    dp.empty();
    
    priority_queue<int> pq;
    pq.push(1);
    pq.pop();
    pq.top();
    pq.size();
    pq.empty();
}

Queue - 队列

在这里插入图片描述
队列是FIFO (First In First Out)
栈是LIFO (Last In First Out) 栈的具体细节不妨看看这个啊～
命名方式也是和栈一样的

基本语句

empty
Test whether container is empty (public member function )
size
Return size (public member function )
front
Access next element (public member function )
back
Access last element (public member function )
push
Insert element (public member function )
emplace
Construct and insert element (public member function )
pop
Remove next element (public member function )
swap
Swap contents (public member function )

Deque - 双端队列

双端队列的意思就是元素可以从队列的两头push or pop

基本语句

push_back
Add element at the end (public member function )
push_front
Insert element at beginning (public member function )
pop_back
Delete last element (public member function )
pop_front
Delete first element (public member function )
insert
Insert elements (public member function )
erase
Erase elements (public member function )
swap
Swap content (public member function )
clear
Clear content (public member function )
emplace
Construct and insert element (public member function )
emplace_front
Construct and insert element at beginning (public member function )
emplace_back
Construct and insert element at the end (public member function )

Priority_queue - 优先队列

其实这就是一个 FILO (First In Last Out) 的队列

基本语句

empty
Test whether container is empty (public member function )
size
Return size (public member function )
top
Access top element (public member function )
push
Insert element (public member function )
emplace
Construct and insert element (public member function )
pop
Remove top element (public member function )
swap
Swap contents (public member function )