CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-03 02:30:25 +08:00
Code Issues Packages Projects Releases Wiki Activity

build

Browse Source
This commit is contained in:
krahets
2024-02-10 03:56:57 +08:00
parent d2fecf1103
commit 7bbed7f9b8
5 changed files with 35 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
docs/chapter_stack_and_queue/queue.md
View File

@@ -332,13 +332,13 @@ comments: true
如图 5-5 所示，我们可以将链表的“头节点”和“尾节点”分别视为“队首”和“队尾”，规定队尾仅可添加节点，队首仅可删除节点。
=== "LinkedListQueue"
![基于链表实现队列的入队出队操作](queue.assets/linkedlist_queue.png){ class="animation-figure" }
![基于链表实现队列的入队出队操作](queue.assets/linkedlist_queue_step1.png){ class="animation-figure" }
=== "push()"
![linkedlist_queue_push](queue.assets/linkedlist_queue_push.png){ class="animation-figure" }
![linkedlist_queue_push](queue.assets/linkedlist_queue_step2_push.png){ class="animation-figure" }
=== "pop()"
![linkedlist_queue_pop](queue.assets/linkedlist_queue_pop.png){ class="animation-figure" }
![linkedlist_queue_pop](queue.assets/linkedlist_queue_step3_pop.png){ class="animation-figure" }
<p align="center"> 图 5-5 &nbsp; 基于链表实现队列的入队出队操作 </p>
@@ -1231,13 +1231,13 @@ comments: true
可以看到，入队和出队操作都只需进行一次操作，时间复杂度均为 $O(1)$ 。
=== "ArrayQueue"
![基于数组实现队列的入队出队操作](queue.assets/array_queue.png){ class="animation-figure" }
![基于数组实现队列的入队出队操作](queue.assets/array_queue_step1.png){ class="animation-figure" }
=== "push()"
![array_queue_push](queue.assets/array_queue_push.png){ class="animation-figure" }
![array_queue_push](queue.assets/array_queue_step2_push.png){ class="animation-figure" }
=== "pop()"
![array_queue_pop](queue.assets/array_queue_pop.png){ class="animation-figure" }
![array_queue_pop](queue.assets/array_queue_step3_pop.png){ class="animation-figure" }
<p align="center"> 图 5-6 &nbsp; 基于数组实现队列的入队出队操作 </p>