比如浏览器的上一步,就是栈的概念,后进先出
![](https://img.haomeiwen.com/i422094/f7532d9c8a41c7d6.png)
![](https://img.haomeiwen.com/i422094/43321231147df6c3.png)
栈的插入和删除操作
![](https://img.haomeiwen.com/i422094/59b6318b5a19a589.png)
栈的定义
![](https://img.haomeiwen.com/i422094/41f5ea8a226c9ab0.png)
栈的创建
![](https://img.haomeiwen.com/i422094/3df905664e398b6f.png)
入栈操作
![](https://img.haomeiwen.com/i422094/ac236405f9251100.png)
![](https://img.haomeiwen.com/i422094/17164a9a60901ede.png)
出栈操作
![](https://img.haomeiwen.com/i422094/3f8eb1bd7a55a8e3.png)
栈的理解
![](https://img.haomeiwen.com/i422094/5de27f59fc5945ff.png)
栈的清空
![](https://img.haomeiwen.com/i422094/8a3408615b241b34.png)
栈的销毁
![](https://img.haomeiwen.com/i422094/dbc7c2bee6b46103.png)
![](https://img.haomeiwen.com/i422094/dc9a5a207e219763.png)
计算栈的容量
![](https://img.haomeiwen.com/i422094/a3bb1c8d16f46e4a.png)
当前容量和最大容量是不同的
比如浏览器的上一步,就是栈的概念,后进先出
栈的插入和删除操作
栈的定义
栈的创建
入栈操作
出栈操作
栈的理解
栈的清空
栈的销毁
计算栈的容量
当前容量和最大容量是不同的
本文标题:数据结构-栈(stack)和队列
本文链接:https://www.haomeiwen.com/subject/adkqeftx.html
网友评论