This commit is contained in:
krahets
2026-04-02 03:08:50 +08:00
parent 09a136c9fa
commit aaf9f58eb3
157 changed files with 3002 additions and 2994 deletions
+25 -25
View File
@@ -6,7 +6,7 @@
<meta charset="utf-8">
<meta name="viewport" content="width=device-width,initial-scale=1">
<meta name="description" content="Data Structures and Algorithms Crash Course with Animated Illustrations and Off-the-Shelf Code">
<meta name="description" content="Data structures and algorithms tutorial with animated illustrations and ready-to-run code">
<meta name="author" content="krahets">
@@ -576,7 +576,7 @@
<span class="md-ellipsis">
Chapter 1. Encounter With Algorithms
Chapter 1. Encounter with Algorithms
@@ -598,7 +598,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 1. Encounter With Algorithms
Chapter 1. Encounter with Algorithms
</label>
@@ -1183,7 +1183,7 @@
<span class="md-ellipsis">
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
@@ -1205,7 +1205,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 4. Array and Linked List
Chapter 4. Arrays and Linked Lists
</label>
@@ -1311,7 +1311,7 @@
<span class="md-ellipsis">
4.4 Memory and Cache *
4.4 Random-Access Memory and Cache *
@@ -1402,7 +1402,7 @@
<span class="md-ellipsis">
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
@@ -1424,7 +1424,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 5. Stack and Queue
Chapter 5. Stacks and Queues
</label>
@@ -1502,7 +1502,7 @@
<span class="md-ellipsis">
5.3 Double-Ended Queue
5.3 Deque
@@ -1593,7 +1593,7 @@
<span class="md-ellipsis">
Chapter 6. Hashing
Chapter 6. Hash Table
@@ -1615,7 +1615,7 @@
<span class="md-nav__icon md-icon"></span>
Chapter 6. Hashing
Chapter 6. Hash Table
</label>
@@ -1888,7 +1888,7 @@
<span class="md-ellipsis">
7.3 Array Representation of Tree
7.3 Array Representation of Binary Trees
@@ -2107,7 +2107,7 @@
<span class="md-ellipsis">
8.2 Building a Heap
8.2 Heap Construction Operation
@@ -2135,7 +2135,7 @@
<span class="md-ellipsis">
8.3 Top-K Problem
8.3 Top-k Problem
@@ -2493,7 +2493,7 @@
<span class="md-ellipsis">
10.2 Binary Search Insertion
10.2 Binary Search Insertion Point
@@ -2521,7 +2521,7 @@
<span class="md-ellipsis">
10.3 Binary Search Edge Cases
10.3 Binary Search Boundaries
@@ -2577,7 +2577,7 @@
<span class="md-ellipsis">
10.5 Search Algorithms Revisited
10.5 Searching Algorithms Revisited
@@ -2726,7 +2726,7 @@
<span class="md-ellipsis">
11.1 Sorting Algorithms
11.1 Sorting Algorithm
@@ -3199,7 +3199,7 @@
<span class="md-ellipsis">
12.4 Hanoi Tower Problem
12.4 Hanota Problem
@@ -4194,7 +4194,7 @@
<span class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
@@ -4391,7 +4391,7 @@
<ol>
<li>Click the "edit icon". If you encounter a prompt asking you to "Fork this repository", please approve the operation.</li>
<li>Modify the content of the Markdown source file, verify the correctness of the content, and maintain consistent formatting as much as possible.</li>
<li>Fill in a description of your changes at the bottom of the page, then click the "Propose file change" button. After the page transitions, click the "Create pull request" button to submit your pull request.</li>
<li>Fill in a description of your changes at the bottom of the page, then click the "Propose file change" button. After the new page loads, click the "Create pull request" button to submit your pull request.</li>
</ol>
<p><img alt="Page edit button" class="animation-figure" src="../contribution.assets/edit_markdown.png" /></p>
<p align="center"> Figure 16-3 &nbsp; Page edit button </p>
@@ -4401,13 +4401,13 @@
<p>If you are interested in contributing to this open source project, including translating code into other programming languages or expanding article content, you will need to follow the Pull Request workflow below.</p>
<ol>
<li>Log in to GitHub and Fork the book's <a href="https://github.com/krahets/hello-algo">code repository</a> to your personal account.</li>
<li>Enter your forked repository webpage and use the <code>git clone</code> command to clone the repository to your local machine.</li>
<li>Go to your forked repository page and use the <code>git clone</code> command to clone the repository to your local machine.</li>
<li>Create content locally and conduct comprehensive tests to verify code correctness.</li>
<li>Commit your local changes and push them to the remote repository.</li>
<li>Refresh the repository webpage and click the "Create pull request" button to submit your pull request.</li>
</ol>
<h3 id="3-docker-deployment">3. &nbsp; Docker Deployment<a class="headerlink" href="#3-docker-deployment" title="Permanent link">&para;</a></h3>
<p>From the root directory of <code>hello-algo</code>, run the following Docker script to access the project at <code>http://localhost:8000</code>:</p>
<p>From the root directory of <code>hello-algo</code>, run the following Docker command to access the project at <code>http://localhost:8000</code>:</p>
<div class="highlight"><pre><span></span><code><a id="__codelineno-0-1" name="__codelineno-0-1" href="#__codelineno-0-1"></a>docker-compose<span class="w"> </span>up<span class="w"> </span>-d
</code></pre></div>
<p>Use the following command to remove the deployment:</p>
@@ -4459,7 +4459,7 @@ aria-label="Footer"
<a
href="../terminology/"
class="md-footer__link md-footer__link--next"
aria-label="Next: 16.3 Terminology Table"
aria-label="Next: 16.3 Glossary"
rel="next"
>
<div class="md-footer__title">
@@ -4467,7 +4467,7 @@ aria-label="Footer"
Next
</span>
<div class="md-ellipsis">
16.3 Terminology Table
16.3 Glossary
</div>
</div>
<div class="md-footer__button md-icon">