队列

Created2025-05-30|Updated2025-06-01

|Post Views:

队列

// 队尾插入元素，队头弹出元素
int q[N], hh=0, tt=-1;  // 队头head， 队尾tail

// 插入
q[++tt] = x;

//弹出
hh++;

// 判断是否为空
if(hh<=tt) not empty;
else empty;

// 取出队头元素
q[hh]

Author: Zhigang Chen

Link: https://chenzhigang00.github.io/2025/05/30/队列/

Copyright Notice: All articles on this blog are licensed under CC BY-NC-SA 4.0 unless otherwise stated.

Related Articles

栈 12345678910111213141516int stk[N], tt; // 栈顶下标// 插入stk[++tt]=x;//弹出tt--;// 判断栈是否为空if(tt>0) not empty;else empty;// 栈顶stk[tt]; 中缀表达式表达式树的中序遍历 12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576#include <iostream>#include <stack>#include <string>#include <unordered_map>using namespace std;stack<int> num;stack<char> op;//优先级表unordered_map<char, int> h{...

链表单链表邻接表：存储图、树 head $\rightarrow \empty$ node: val, next 值数组： e[N] (val数组) 指针数组: ne[N] (next 数组) e和ne用下标关联起来代码 1234567891011121314151617181920212223242526272829const int N = 100010;// idx 存储当前已经用到哪个点int head, e[N], ne[N], idx;void init(){ head = -1; idx = 0;}//将x插到头节点void add_to_head(int x){ e[idx] = x; ne[idx] = head; head = idx; ++idx;}// 将x插到下标是k的结点后面void add(int x, int k){ e[idx] = x; ne[idx] = ne[k]; ne[k] = idx; idx++;}/...