algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-25 11:13:38 +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

20
docs/chapter_stack_and_queue/deque.md
View File

@ -358,19 +358,19 @@ comments: true
如图 5-8 所示，我们将双向链表的头节点和尾节点视为双向队列的队首和队尾，同时实现在两端添加和删除节点的功能。
=== "LinkedListDeque"
![基于链表实现双向队列的入队出队操作](deque.assets/linkedlist_deque.png){ class="animation-figure" }
![基于链表实现双向队列的入队出队操作](deque.assets/linkedlist_deque_step1.png){ class="animation-figure" }
=== "push_last()"
![linkedlist_deque_push_last](deque.assets/linkedlist_deque_push_last.png){ class="animation-figure" }
![linkedlist_deque_push_last](deque.assets/linkedlist_deque_step2_push_last.png){ class="animation-figure" }
=== "push_first()"
![linkedlist_deque_push_first](deque.assets/linkedlist_deque_push_first.png){ class="animation-figure" }
![linkedlist_deque_push_first](deque.assets/linkedlist_deque_step3_push_first.png){ class="animation-figure" }
=== "pop_last()"
![linkedlist_deque_pop_last](deque.assets/linkedlist_deque_pop_last.png){ class="animation-figure" }
![linkedlist_deque_pop_last](deque.assets/linkedlist_deque_step4_pop_last.png){ class="animation-figure" }
=== "pop_first()"
![linkedlist_deque_pop_first](deque.assets/linkedlist_deque_pop_first.png){ class="animation-figure" }
![linkedlist_deque_pop_first](deque.assets/linkedlist_deque_step5_pop_first.png){ class="animation-figure" }
<p align="center"> 图 5-8 &nbsp; 基于链表实现双向队列的入队出队操作 </p>
@ -1996,19 +1996,19 @@ comments: true
如图 5-9 所示，与基于数组实现队列类似，我们也可以使用环形数组来实现双向队列。
=== "ArrayDeque"
![基于数组实现双向队列的入队出队操作](deque.assets/array_deque.png){ class="animation-figure" }
![基于数组实现双向队列的入队出队操作](deque.assets/array_deque_step1.png){ class="animation-figure" }
=== "push_last()"
![array_deque_push_last](deque.assets/array_deque_push_last.png){ class="animation-figure" }
![array_deque_push_last](deque.assets/array_deque_step2_push_last.png){ class="animation-figure" }
=== "push_first()"
![array_deque_push_first](deque.assets/array_deque_push_first.png){ class="animation-figure" }
![array_deque_push_first](deque.assets/array_deque_step3_push_first.png){ class="animation-figure" }
=== "pop_last()"
![array_deque_pop_last](deque.assets/array_deque_pop_last.png){ class="animation-figure" }
![array_deque_pop_last](deque.assets/array_deque_step4_pop_last.png){ class="animation-figure" }
=== "pop_first()"
![array_deque_pop_first](deque.assets/array_deque_pop_first.png){ class="animation-figure" }
![array_deque_pop_first](deque.assets/array_deque_step5_pop_first.png){ class="animation-figure" }
<p align="center"> 图 5-9 &nbsp; 基于数组实现双向队列的入队出队操作 </p>

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>

12
docs/chapter_stack_and_queue/stack.md
View File

@ -330,13 +330,13 @@ comments: true
如图 5-2 所示，对于入栈操作，我们只需将元素插入链表头部，这种节点插入方法被称为“头插法”。而对于出栈操作，只需将头节点从链表中删除即可。
=== "LinkedListStack"
![基于链表实现栈的入栈出栈操作](stack.assets/linkedlist_stack.png){ class="animation-figure" }
![基于链表实现栈的入栈出栈操作](stack.assets/linkedlist_stack_step1.png){ class="animation-figure" }
=== "push()"
![linkedlist_stack_push](stack.assets/linkedlist_stack_push.png){ class="animation-figure" }
![linkedlist_stack_push](stack.assets/linkedlist_stack_step2_push.png){ class="animation-figure" }
=== "pop()"
![linkedlist_stack_pop](stack.assets/linkedlist_stack_pop.png){ class="animation-figure" }
![linkedlist_stack_pop](stack.assets/linkedlist_stack_step3_pop.png){ class="animation-figure" }
<p align="center"> 图 5-2 &nbsp; 基于链表实现栈的入栈出栈操作 </p>
@ -1094,13 +1094,13 @@ comments: true
使用数组实现栈时，我们可以将数组的尾部作为栈顶。如图 5-3 所示，入栈与出栈操作分别对应在数组尾部添加元素与删除元素，时间复杂度都为 $O(1)$ 。
=== "ArrayStack"
![基于数组实现栈的入栈出栈操作](stack.assets/array_stack.png){ class="animation-figure" }
![基于数组实现栈的入栈出栈操作](stack.assets/array_stack_step1.png){ class="animation-figure" }
=== "push()"
![array_stack_push](stack.assets/array_stack_push.png){ class="animation-figure" }
![array_stack_push](stack.assets/array_stack_step2_push.png){ class="animation-figure" }
=== "pop()"
![array_stack_pop](stack.assets/array_stack_pop.png){ class="animation-figure" }
![array_stack_pop](stack.assets/array_stack_step3_pop.png){ class="animation-figure" }
<p align="center"> 图 5-3 &nbsp; 基于数组实现栈的入栈出栈操作 </p>