algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-06 15:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 栈与队列理论基础 排版格式修复

Browse Source
This commit is contained in:
jinbudaily
2023-07-20 14:36:04 +08:00
parent c3ebc91d4d
commit de770c60e5
1 changed files with 4 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/栈与队列理论基础.md
View File

@ -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>