From de770c60e5ae781a9e65071e03ba4876237ed6fb Mon Sep 17 00:00:00 2001
From: jinbudaily <18336218010@163.com>
Date: Thu, 20 Jul 2023 14:36:04 +0800
Subject: [PATCH] =?UTF-8?q?=E6=9B=B4=E6=96=B0=20=E6=A0=88=E4=B8=8E?=
 =?UTF-8?q?=E9=98=9F=E5=88=97=E7=90=86=E8=AE=BA=E5=9F=BA=E7=A1=80=20?=
 =?UTF-8?q?=E6=8E=92=E7=89=88=E6=A0=BC=E5=BC=8F=E4=BF=AE=E5=A4=8D?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/栈与队列理论基础.md | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/problems/栈与队列理论基础.md b/problems/栈与队列理论基础.md
index 0075deb6..ad748e48 100644
--- a/problems/栈与队列理论基础.md
+++ b/problems/栈与队列理论基础.md
@@ -4,8 +4,11 @@
 </a>
 <p align="center"><strong><a href="https://mp.weixin.qq.com/s/tqCxrMEU-ajQumL1i8im9A">参与本项目</a>，贡献其他语言版本的代码，拥抱开源，让更多学习算法的小伙伴们收益！</strong></p>
 
+
 > 来看看栈和队列不为人知的一面
 
+# 栈与队列理论基础
+
 我想栈和队列的原理大家应该很熟悉了，队列是先进先出，栈是先进后出。
 
 如图所示：
@@ -93,3 +96,4 @@ std::queue<int, std::list<int>> third; // 定义以list为底层容器的队列
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
+