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

deploy

Browse Source
This commit is contained in:
krahets
2023-02-26 20:16:38 +08:00
parent 7cc1de8bff
commit c20bdb15ac
50 changed files with 131 additions and 131 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
chapter_stack_and_queue/queue/index.html
View File

@@ -79,7 +79,7 @@
<div data-md-component="skip">
<a href="#52" class="md-skip">
<a href="#52-queue" class="md-skip">
跳转至
</a>
@@ -680,7 +680,7 @@
<li class="md-nav__item">
<a href="../../chapter_array_and_linkedlist/linked_list/" class="md-nav__link">
4.2. &nbsp; 链表（LinkedList）
4.2. &nbsp; 链表（Linked List）
</a>
</li>
@@ -954,7 +954,7 @@
<li class="md-nav__item">
<a href="../../chapter_hashing/hash_map/" class="md-nav__link">
6.1. &nbsp; 哈希表（HashMap）
6.1. &nbsp; 哈希表（Hash Map）
</a>
</li>
@@ -1655,7 +1655,7 @@
<h1 id="52">5.2. &nbsp; 队列<a class="headerlink" href="#52" title="Permanent link">&para;</a></h1>
<h1 id="52-queue">5.2. &nbsp; 队列（Queue）<a class="headerlink" href="#52-queue" title="Permanent link">&para;</a></h1>
<p>「队列 Queue」是一种遵循「先入先出 first in, first out」数据操作规则的线性数据结构。顾名思义，队列模拟的是排队现象，即外面的人不断加入队列尾部，而处于队列头部的人不断地离开。</p>
<p>我们将队列头部称为「队首」，队列尾部称为「队尾」，将把元素加入队尾的操作称为「入队」，删除队首元素的操作称为「出队」。</p>
<p><img alt="队列的先入先出规则" src="../queue.assets/queue_operations.png" /></p>