algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-29 05:13:14 +08:00
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets
2023-11-09 05:13:54 +08:00
parent 9a09f9407e
commit 3f666fa676
85 changed files with 619 additions and 610 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
chapter_stack_and_queue/stack/index.html
View File

@ -3423,7 +3423,7 @@
<p>「栈 stack」是一种遵循先入后出的逻辑的线性数据结构。</p>
<p>我们可以将栈类比为桌面上的一摞盘子，如果需要拿出底部的盘子，则需要先将上面的盘子依次取出。我们将盘子替换为各种类型的元素（如整数、字符、对象等），就得到了栈数据结构。</p>
<p>如图 5-1 所示，我们把堆叠元素的顶部称为“栈顶”，底部称为“栈底”。将把元素添加到栈顶的操作叫做“入栈”，删除栈顶元素的操作叫做“出栈”。</p>
<p><a class="glightbox" href="../stack.assets/stack_operations.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="栈的先入后出规则" src="../stack.assets/stack_operations.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/stack_operations.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="栈的先入后出规则" class="animation-figure" src="../stack.assets/stack_operations.png" /></a></p>
<p align="center"> 图 5-1 &nbsp; 栈的先入后出规则 </p>
<h2 id="511">5.1.1 &nbsp; 栈常用操作<a class="headerlink" href="#511" title="Permanent link">&para;</a></h2>
@ -3728,13 +3728,13 @@
<div class="tabbed-set tabbed-alternate" data-tabs="2:3"><input checked="checked" id="__tabbed_2_1" name="__tabbed_2" type="radio" /><input id="__tabbed_2_2" name="__tabbed_2" type="radio" /><input id="__tabbed_2_3" name="__tabbed_2" type="radio" /><div class="tabbed-labels"><label for="__tabbed_2_1">LinkedListStack</label><label for="__tabbed_2_2">push()</label><label for="__tabbed_2_3">pop()</label></div>
<div class="tabbed-content">
<div class="tabbed-block">
<p><a class="glightbox" href="../stack.assets/linkedlist_stack.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="基于链表实现栈的入栈出栈操作" src="../stack.assets/linkedlist_stack.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/linkedlist_stack.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="基于链表实现栈的入栈出栈操作" class="animation-figure" src="../stack.assets/linkedlist_stack.png" /></a></p>
</div>
<div class="tabbed-block">
<p><a class="glightbox" href="../stack.assets/linkedlist_stack_push.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="linkedlist_stack_push" src="../stack.assets/linkedlist_stack_push.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/linkedlist_stack_push.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="linkedlist_stack_push" class="animation-figure" src="../stack.assets/linkedlist_stack_push.png" /></a></p>
</div>
<div class="tabbed-block">
<p><a class="glightbox" href="../stack.assets/linkedlist_stack_pop.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="linkedlist_stack_pop" src="../stack.assets/linkedlist_stack_pop.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/linkedlist_stack_pop.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="linkedlist_stack_pop" class="animation-figure" src="../stack.assets/linkedlist_stack_pop.png" /></a></p>
</div>
</div>
</div>
@ -4473,13 +4473,13 @@
<div class="tabbed-set tabbed-alternate" data-tabs="4:3"><input checked="checked" id="__tabbed_4_1" name="__tabbed_4" type="radio" /><input id="__tabbed_4_2" name="__tabbed_4" type="radio" /><input id="__tabbed_4_3" name="__tabbed_4" type="radio" /><div class="tabbed-labels"><label for="__tabbed_4_1">ArrayStack</label><label for="__tabbed_4_2">push()</label><label for="__tabbed_4_3">pop()</label></div>
<div class="tabbed-content">
<div class="tabbed-block">
<p><a class="glightbox" href="../stack.assets/array_stack.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="基于数组实现栈的入栈出栈操作" src="../stack.assets/array_stack.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/array_stack.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="基于数组实现栈的入栈出栈操作" class="animation-figure" src="../stack.assets/array_stack.png" /></a></p>
</div>
<div class="tabbed-block">
<p><a class="glightbox" href="../stack.assets/array_stack_push.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="array_stack_push" src="../stack.assets/array_stack_push.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/array_stack_push.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="array_stack_push" class="animation-figure" src="../stack.assets/array_stack_push.png" /></a></p>
</div>
<div class="tabbed-block">
<p><a class="glightbox" href="../stack.assets/array_stack_pop.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="array_stack_pop" src="../stack.assets/array_stack_pop.png" /></a></p>
<p><a class="glightbox" href="../stack.assets/array_stack_pop.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="array_stack_pop" class="animation-figure" src="../stack.assets/array_stack_pop.png" /></a></p>
</div>
</div>
</div>