yetao
/
hello-algo
mirror of https://github.com/krahets/hello-algo.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

deploy

Browse Source
gh-pages
krahets 10 months ago
parent edb3fe6d8c
commit be6b137198
15 changed files with 190 additions and 182 deletions
Show Stats Download Patch File Download Diff File

2
chapter_computational_complexity/space_complexity/index.html
Unescape View File

@ -5498,7 +5498,7 @@ O(1) < O(\log n) < O(n) < O(n^2) < O(2^n) \newline
<h3 id="5-olog-n">5. &nbsp; 对数阶 <span class="arithmatex">\(O(\log n)\)</span><a class="headerlink" href="#5-olog-n" title="Permanent link">&para;</a></h3>
<p>对数阶常见于分治算法。例如归并排序，输入长度为 <span class="arithmatex">\(n\)</span> 的数组，每轮递归将数组从中点处划分为两半，形成高度为 <span class="arithmatex">\(\log n\)</span> 的递归树，使用 <span class="arithmatex">\(O(\log n)\)</span> 栈帧空间。</p>
<p>再例如将数字转化为字符串，输入一个正整数 <span class="arithmatex">\(n\)</span> ，它的位数为 <span class="arithmatex">\(\log_{10} n + 1\)</span> ，即对应字符串长度为 <span class="arithmatex">\(\log_{10} n + 1\)</span> ，因此空间复杂度为 <span class="arithmatex">\(O(\log_{10} n + 1) = O(\log n)\)</span> 。</p>
<p>再例如将数字转化为字符串，输入一个正整数 <span class="arithmatex">\(n\)</span> ，它的位数为 <span class="arithmatex">\(\lfloor \log_{10} n \rfloor + 1\)</span> ，即对应字符串长度为 <span class="arithmatex">\(\lfloor \log_{10} n \rfloor + 1\)</span> ，因此空间复杂度为 <span class="arithmatex">\(O(\log_{10} n + 1) = O(\log n)\)</span> 。</p>
<h2 id="244">2.4.4 &nbsp; 权衡时间与空间<a class="headerlink" href="#244" title="Permanent link">&para;</a></h2>
<p>理想情况下，我们希望算法的时间复杂度和空间复杂度都能达到最优。然而在实际情况中，同时优化时间复杂度和空间复杂度通常非常困难。</p>
<p><strong>降低时间复杂度通常需要以提升空间复杂度为代价，反之亦然</strong>。我们将牺牲内存空间来提升算法运行速度的思路称为“以空间换时间”；反之，则称为“以时间换空间”。</p>

2
chapter_data_structure/character_encoding/index.html
Unescape View File

@ -3624,7 +3624,7 @@
<li>JavaScript 和 TypeScript 的字符串使用 UTF-16 编码的原因与 Java 类似。当 1995 年 Netscape 公司首次推出 JavaScript 语言时，Unicode 还处于发展早期，那时候使用 16 位的编码就足以表示所有的 Unicode 字符了。</li>
<li>C# 使用 UTF-16 编码，主要是因为 .NET 平台是由 Microsoft 设计的，而 Microsoft 的很多技术（包括 Windows 操作系统）都广泛使用 UTF-16 编码。</li>
</ul>
<p>由于以上编程语言对字符数量的低估，它们不得不采取“代理对”的方式来表示超过 16 位长度的 Unicode 字符。这是一个不得已为之的无奈之举。一方面，包含代理对的字符串中，一个字符可能占用 2 字节或 4 字节，从而丧失了等长编码的优势。另一方面，处理代理对需要增加额外代码，这提高了编程的复杂性和调试难度。</p>
<p>由于以上编程语言对字符数量的低估，它们不得不采取“代理对”的方式来表示超过 16 位长度的 Unicode 字符。这是一个不得已为之的无奈之举。一方面，包含代理对的字符串中，一个字符可能占用 2 字节或 4 字节，从而丧失了等长编码的优势。另一方面，处理代理对需要额外增加代码，这提高了编程的复杂性和调试难度。</p>
<p>出于以上原因，部分编程语言提出了一些不同的编码方案。</p>
<ul>
<li>Python 中的 <code>str</code> 使用 Unicode 编码，并采用一种灵活的字符串表示，存储的字符长度取决于字符串中最大的 Unicode 码点。若字符串中全部是 ASCII 字符，则每个字符占用 1 字节；如果有字符超出了 ASCII 范围，但全部在基本多语言平面（BMP）内，则每个字符占用 2 字节；如果有超出 BMP 的字符，则每个字符占用 4 字节。</li>

9
chapter_data_structure/classification_of_data_structure/index.html
Unescape View File

@ -3520,18 +3520,17 @@
<p><strong>逻辑结构揭示了数据元素之间的逻辑关系</strong>。在数组和链表中，数据按照一定顺序排列，体现了数据之间的线性关系；而在树中，数据从顶部向下按层次排列，表现出“祖先”与“后代”之间的派生关系；图则由节点和边构成，反映了复杂的网络关系。</p>
<p>如图 3-1 所示，逻辑结构可分为“线性”和“非线性”两大类。线性结构比较直观，指数据在逻辑关系上呈线性排列；非线性结构则相反，呈非线性排列。</p>
<ul>
<li><strong>线性数据结构</strong>：数组、链表、栈、队列、哈希表。</li>
<li><strong>线性数据结构</strong>：数组、链表、栈、队列、哈希表，元素之间是一对一的顺序关系。</li>
<li><strong>非线性数据结构</strong>：树、堆、图、哈希表。</li>
</ul>
<p><a class="glightbox" href="../classification_of_data_structure.assets/classification_logic_structure.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="线性数据结构与非线性数据结构" class="animation-figure" src="../classification_of_data_structure.assets/classification_logic_structure.png" /></a></p>
<p align="center"> 图 3-1 &nbsp; 线性数据结构与非线性数据结构 </p>
<p>非线性数据结构可以进一步划分为树形结构和网状结构。</p>
<ul>
<li><strong>线性结构</strong>：数组、链表、队列、栈、哈希表，元素之间是一对一的顺序关系。</li>
<li><strong>树形结构</strong>：树、堆、哈希表，元素之间是一对多的关系。</li>
<li><strong>网状结构</strong>：图，元素之间是多对多的关系。</li>
</ul>
<p><a class="glightbox" href="../classification_of_data_structure.assets/classification_logic_structure.png" data-type="image" data-width="100%" data-height="auto" data-desc-position="bottom"><img alt="线性数据结构与非线性数据结构" class="animation-figure" src="../classification_of_data_structure.assets/classification_logic_structure.png" /></a></p>
<p align="center"> 图 3-1 &nbsp; 线性数据结构与非线性数据结构 </p>
<h2 id="312">3.1.2 &nbsp; 物理结构：连续与分散<a class="headerlink" href="#312" title="Permanent link">&para;</a></h2>
<p><strong>当算法程序运行时，正在处理的数据主要存储在内存中</strong>。图 3-2 展示了一个计算机内存条，其中每个黑色方块都包含一块内存空间。我们可以将内存想象成一个巨大的 Excel 表格，其中每个单元格都可以存储一定大小的数据。</p>
<p><strong>系统通过内存地址来访问目标位置的数据</strong>。如图 3-2 所示，计算机根据特定规则为表格中的每个单元格分配编号，确保每个内存空间都有唯一的内存地址。有了这些地址，程序便可以访问内存中的数据。</p>

2
chapter_stack_and_queue/queue/index.html
Unescape View File

@ -4604,7 +4604,7 @@
<a id="__codelineno-22-16" name="__codelineno-22-16" href="#__codelineno-22-16"></a><span class="cm">/* 析构函数 */</span>
<a id="__codelineno-22-17" name="__codelineno-22-17" href="#__codelineno-22-17"></a><span class="kt">void</span><span class="w"> </span><span class="nf">delLinkedListQueue</span><span class="p">(</span><span class="n">LinkedListQueue</span><span class="w"> </span><span class="o">*</span><span class="n">queue</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-22-18" name="__codelineno-22-18" href="#__codelineno-22-18"></a><span class="w"> </span><span class="c1">// 释放所有节点</span>
<a id="__codelineno-22-19" name="__codelineno-22-19" href="#__codelineno-22-19"></a><span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">queSize</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="nb">NULL</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-22-19" name="__codelineno-22-19" href="#__codelineno-22-19"></a><span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="nb">NULL</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-22-20" name="__codelineno-22-20" href="#__codelineno-22-20"></a><span class="w"> </span><span class="n">ListNode</span><span class="w"> </span><span class="o">*</span><span class="n">tmp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="p">;</span>
<a id="__codelineno-22-21" name="__codelineno-22-21" href="#__codelineno-22-21"></a><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="o">-&gt;</span><span class="n">next</span><span class="p">;</span>
<a id="__codelineno-22-22" name="__codelineno-22-22" href="#__codelineno-22-22"></a><span class="w"> </span><span class="n">free</span><span class="p">(</span><span class="n">tmp</span><span class="p">);</span>

2
en/chapter_stack_and_queue/queue/index.html
Unescape View File

@ -2471,7 +2471,7 @@
<a id="__codelineno-22-16" name="__codelineno-22-16" href="#__codelineno-22-16"></a><span class="cm">/* 析构函数 */</span>
<a id="__codelineno-22-17" name="__codelineno-22-17" href="#__codelineno-22-17"></a><span class="kt">void</span><span class="w"> </span><span class="nf">delLinkedListQueue</span><span class="p">(</span><span class="n">LinkedListQueue</span><span class="w"> </span><span class="o">*</span><span class="n">queue</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-22-18" name="__codelineno-22-18" href="#__codelineno-22-18"></a><span class="w"> </span><span class="c1">// 释放所有节点</span>
<a id="__codelineno-22-19" name="__codelineno-22-19" href="#__codelineno-22-19"></a><span class="w"> </span><span class="k">for</span><span class="w"> </span><span class="p">(</span><span class="kt">int</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="mi">0</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="w"> </span><span class="o">&lt;</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">queSize</span><span class="w"> </span><span class="o">&amp;&amp;</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="nb">NULL</span><span class="p">;</span><span class="w"> </span><span class="n">i</span><span class="o">++</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-22-19" name="__codelineno-22-19" href="#__codelineno-22-19"></a><span class="w"> </span><span class="k">while</span><span class="w"> </span><span class="p">(</span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="w"> </span><span class="o">!=</span><span class="w"> </span><span class="nb">NULL</span><span class="p">)</span><span class="w"> </span><span class="p">{</span>
<a id="__codelineno-22-20" name="__codelineno-22-20" href="#__codelineno-22-20"></a><span class="w"> </span><span class="n">ListNode</span><span class="w"> </span><span class="o">*</span><span class="n">tmp</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="p">;</span>
<a id="__codelineno-22-21" name="__codelineno-22-21" href="#__codelineno-22-21"></a><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="w"> </span><span class="o">=</span><span class="w"> </span><span class="n">queue</span><span class="o">-&gt;</span><span class="n">front</span><span class="o">-&gt;</span><span class="n">next</span><span class="p">;</span>
<a id="__codelineno-22-22" name="__codelineno-22-22" href="#__codelineno-22-22"></a><span class="w"> </span><span class="n">free</span><span class="p">(</span><span class="n">tmp</span><span class="p">);</span>

2
en/search/search_index.json
View File

File diff suppressed because one or more lines are too long

64
en/sitemap.xml
Unescape View File

@ -2,162 +2,162 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/en/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/array/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/list/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/ram_and_cache/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/iteration_and_recursion/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/basic_data_types/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/character_encoding/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/number_encoding/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_data_structure/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_introduction/what_is_dsa/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/about_the_book/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/suggestions/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_preface/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/deque/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/queue/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/stack/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/en/chapter_stack_and_queue/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
en/sitemap.xml.gz
View File

Binary file not shown.

17
en/stylesheets/extra.css
Unescape View File

@ -204,7 +204,7 @@ body {
background-color: var(--md-default-bg-color);
color: var(--md-default-fg-color);
font-size: 0.9rem;
padding: 2em;
padding: 3em 2em;
text-align: center;
}
@ -221,7 +221,7 @@ body {
justify-content: center;
border-radius: 10em;
margin: 0 0.1em;
padding: 0.5em 1.3em;
padding: 0.6em 1.3em;
border: none;
background-color: var(--md-typeset-btn-color);
color: var(--md-primary-fg-color) !important;
@ -234,9 +234,10 @@ body {
background-color: var(--md-typeset-btn-hover-color);
}
.rounded-button p {
.rounded-button span {
margin: 0;
margin-bottom: 0.1em;
margin-bottom: 0.07em;
white-space: nowrap;
}
.rounded-button svg {
@ -257,18 +258,22 @@ body {
}
.text-button {
width: 100%;
display: flex;
flex-direction: row;
align-items: center;
color: var(--md-typeset-btn-color);
text-decoration: none;
margin: 0 1em;
}
.text-button:hover {
text-decoration: underline;
}
.text-button span {
white-space: nowrap;
}
.text-button svg {
display: inline-block;
fill: var(--md-typeset-btn-color);
@ -288,7 +293,7 @@ body {
padding: 0;
position: relative;
color: white;
font-size: min(2vh, 2.5vw);
font-size: min(1.8vh, 2.5vw);
font-weight: 500;
}

44
index.html
Unescape View File

@ -247,91 +247,91 @@
style="position: absolute; width: auto; height: 78.751%; left: 10.545%; top: 7.326%;">
<a href="/chapter_introduction/">
<img class="hero-on-hover" src="assets/hero/astronaut.png" style="height: 46.673%; left: 35.413%; top: 24.343%;">
<p class="hero-caption" style="left: 52.244%; top: 20.919%;">初识算法</p>
<span class="hero-caption" style="left: 52.244%; top: 20.919%;">初识算法</span>
</a>
<a href="/chapter_computational_complexity/">
<img class="hero-on-hover" src="assets/hero/chapter_computational_complexity.png"
style="height: 12.347%; left: 36.267%; top: 37.653%;">
<p class="hero-caption" style="left: 39.244%; top: 33.919%;">复杂度</p>
<span class="hero-caption" style="left: 39.244%; top: 33.919%;">复杂度</span>
</a>
<a href="/chapter_array_and_linkedlist/">
<img class="hero-on-hover" src="assets/hero/chapter_array_and_linkedlist.png"
style="height: 22.242%; left: 73.242%; top: 52.481%;">
<p class="hero-caption" style="left: 90.897%; top: 76.259%;">数组与链表</p>
<span class="hero-caption" style="left: 90.897%; top: 76.259%;">数组与链表</span>
</a>
<a href="/chapter_stack_and_queue/">
<img class="hero-on-hover" src="assets/hero/chapter_stack_and_queue.png"
style="height: 14.302%; left: 62.646%; top: 77.875%;">
<p class="hero-caption" style="left: 78.371%; top: 90.25%;">栈与队列</p>
<span class="hero-caption" style="left: 77.571%; top: 91.25%;">栈与队列</span>
</a>
<a href="/chapter_hashing/">
<img class="hero-on-hover" src="assets/hero/chapter_hashing.png"
style="height: 15.266%; left: 63.281%; top: 27.933%;">
<p class="hero-caption" style="left: 68.862%; top: 46.292%;">哈希表</p>
<span class="hero-caption" style="left: 68.862%; top: 46.292%;">哈希表</span>
</a>
<a href="/chapter_tree/">
<img class="hero-on-hover" src="assets/hero/chapter_tree.png"
style="height: 19.615%; left: 80.137%; top: 26.678%;">
<p class="hero-caption" style="left: 96.159%; top: 44.8%;">树</p>
<span class="hero-caption" style="left: 96.159%; top: 44.8%;">树</span>
</a>
<a href="/chapter_heap/">
<img class="hero-on-hover" src="assets/hero/chapter_heap.png"
style="height: 10.566%; left: 77.226%; top: 11.559%;">
<p class="hero-caption" style="left: 88.103%; top: 15.422%;">堆</p>
<span class="hero-caption" style="left: 88.103%; top: 15.422%;">堆</span>
</a>
<a href="/chapter_graph/">
<img class="hero-on-hover" src="assets/hero/chapter_graph.png"
style="height: 16.112%; left: 51.854%; top: 5.575%;">
<p class="hero-caption" style="left: 71.195%; top: 6.503%;">图</p>
<span class="hero-caption" style="left: 71.195%; top: 6.503%;">图</span>
</a>
<a href="/chapter_searching/">
<img class="hero-on-hover" src="assets/hero/chapter_searching.png"
style="height: 15.149%; left: 18.185%; top: 16.404%;">
<p class="hero-caption" style="left: 14.556%; top: 20.876%;">搜索</p>
<span class="hero-caption" style="left: 14.556%; top: 20.876%;">搜索</span>
</a>
<a href="/chapter_sorting/">
<img class="hero-on-hover" src="assets/hero/chapter_sorting.png"
style="height: 9.574%; left: 25.409%; top: 40.747%;">
<p class="hero-caption" style="left: 28.805%; top: 53.808%;">排序</p>
<span class="hero-caption" style="left: 28.805%; top: 53.808%;">排序</span>
</a>
<a href="/chapter_divide_and_conquer/">
<img class="hero-on-hover" src="assets/hero/chapter_divide_and_conquer.png"
style="height: 18.681%; left: 32.721%; top: 4.816%;">
<p class="hero-caption" style="left: 31.42%; top: 8.679%;">分治</p>
<span class="hero-caption" style="left: 31.42%; top: 8.679%;">分治</span>
</a>
<a href="/chapter_backtracking/">
<img class="hero-on-hover" src="assets/hero/chapter_backtracking.png"
style="height: 17.338%; left: 4.875%; top: 32.925%;">
<p class="hero-caption" style="left: 4.742%; top: 50.113%;">回溯</p>
<span class="hero-caption" style="left: 4.742%; top: 50.113%;">回溯</span>
</a>
<a href="/chapter_dynamic_programming/">
<img class="hero-on-hover" src="assets/hero/chapter_dynamic_programming.png"
style="height: 15.47%; left: 9.406%; top: 57.472%;">
<p class="hero-caption" style="left: 8.561%; top: 75.351%;">动态规划</p>
<span class="hero-caption" style="left: 8.561%; top: 75.351%;">动态规划</span>
</a>
<a href="/chapter_greedy/">
<img class="hero-on-hover" src="assets/hero/chapter_greedy.png"
style="height: 14.127%; left: 23.132%; top: 75.803%;">
<p class="hero-caption" style="left: 21.619%; top: 86.85%;">贪心</p>
<span class="hero-caption" style="left: 21.619%; top: 86.85%;">贪心</span>
</a>
</div>
<!-- heading and buttons -->
<div style="width: 100%; position: absolute; transform: translateX(-50%); left: 50%; bottom: min(2vh, 3vw);">
<div style="width: 100%; position: absolute; transform: translateX(-50%); left: 50%; bottom: min(2vh, 3vw); pointer-events: none;">
<img style="height: min(9vh, 12vw);"
src="https://readme-typing-svg.demolab.com/?font=Noto+Sans+SC&weight=400&duration=3500&pause=2000&color=FFF&center=true&vCenter=true&random=false&width=200&lines=Hello%2C+%E7%AE%97%E6%B3%95+!"
alt="hello-algo-typing-svg" />
<p style="color: #fff; margin-top: max(-1vh, -2vw); margin-bottom: min(2vh, 3.5vw);">
动画图解、一键运行的数据结构与算法教程
</p>
<div>
<div style="pointer-events: auto;">
<a href="/chapter_preface/" class="rounded-button">
<svg xmlns="http://www.w3.org/2000/svg"
viewBox="0 0 512 512"><!--!Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free Copyright 2024 Fonticons, Inc.-->
<path
d="M160 96a96 96 0 1 1 192 0A96 96 0 1 1 160 96zm80 152V512l-48.4-24.2c-20.9-10.4-43.5-17-66.8-19.3l-96-9.6C12.5 457.2 0 443.5 0 427V224c0-17.7 14.3-32 32-32H62.3c63.6 0 125.6 19.6 177.7 56zm32 264V248c52.1-36.4 114.1-56 177.7-56H480c17.7 0 32 14.3 32 32V427c0 16.4-12.5 30.2-28.8 31.8l-96 9.6c-23.2 2.3-45.9 8.9-66.8 19.3L272 512z" />
</svg>
<p>开始阅读</p>
<span>开始阅读</span>
</a>
<a href="https://github.com/krahets/hello-algo" class="rounded-button">
<svg xmlns="http://www.w3.org/2000/svg"
@ -340,7 +340,7 @@
d="M165.9 397.4c0 2-2.3 3.6-5.2 3.6-3.3 .3-5.6-1.3-5.6-3.6 0-2 2.3-3.6 5.2-3.6 3-.3 5.6 1.3 5.6 3.6zm-31.1-4.5c-.7 2 1.3 4.3 4.3 4.9 2.6 1 5.6 0 6.2-2s-1.3-4.3-4.3-5.2c-2.6-.7-5.5 .3-6.2 2.3zm44.2-1.7c-2.9 .7-4.9 2.6-4.6 4.9 .3 2 2.9 3.3 5.9 2.6 2.9-.7 4.9-2.6 4.6-4.6-.3-1.9-3-3.2-5.9-2.9zM244.8 8C106.1 8 0 113.3 0 252c0 110.9 69.8 205.8 169.5 239.2 12.8 2.3 17.3-5.6 17.3-12.1 0-6.2-.3-40.4-.3-61.4 0 0-70 15-84.7-29.8 0 0-11.4-29.1-27.8-36.6 0 0-22.9-15.7 1.6-15.4 0 0 24.9 2 38.6 25.8 21.9 38.6 58.6 27.5 72.9 20.9 2.3-16 8.8-27.1 16-33.7-55.9-6.2-112.3-14.3-112.3-110.5 0-27.5 7.6-41.3 23.6-58.9-2.6-6.5-11.1-33.3 2.6-67.9 20.9-6.5 69 27 69 27 20-5.6 41.5-8.5 62.8-8.5s42.8 2.9 62.8 8.5c0 0 48.1-33.6 69-27 13.7 34.7 5.2 61.4 2.6 67.9 16 17.7 25.8 31.5 25.8 58.9 0 96.5-58.9 104.2-114.8 110.5 9.2 7.9 17 22.9 17 46.4 0 33.7-.3 75.4-.3 83.6 0 6.5 4.6 14.4 17.3 12.1C428.2 457.8 496 362.9 496 252 496 113.3 383.5 8 244.8 8zM97.2 352.9c-1.3 1-1 3.3 .7 5.2 1.6 1.6 3.9 2.3 5.2 1 1.3-1 1-3.3-.7-5.2-1.6-1.6-3.9-2.3-5.2-1zm-10.8-8.1c-.7 1.3 .3 2.9 2.3 3.9 1.6 1 3.6 .7 4.3-.7 .7-1.3-.3-2.9-2.3-3.9-2-.6-3.6-.3-4.3 .7zm32.4 35.6c-1.6 1.3-1 4.3 1.3 6.2 2.3 2.3 5.2 2.6 6.5 1 1.3-1.3 .7-4.3-1.3-6.2-2.2-2.3-5.2-2.6-6.5-1zm-11.4-14.7c-1.6 1-1.6 3.6 0 5.9 1.6 2.3 4.3 3.3 5.6 2.3 1.6-1.3 1.6-3.9 0-6.2-1.4-2.3-4-3.3-5.6-2z">
</path>
</svg>
<p>代码仓库</p>
<span>代码仓库</span>
</a>
</div>
<!-- arrow -->
@ -381,7 +381,7 @@
<!-- Section: reading -->
<section data-md-color-scheme="default" data-md-color-primary="white" class="home-div">
<div class="section-content">
<div style="height: min(37vh, 33vw); width: min(75vh, 75vw); position: relative; margin: 1em auto;">
<div style="height: min(37vh, 33vw); width: min(75vh, 75vw); position: relative; margin: 0.5em auto;">
<!-- devices -->
<!-- mac height = 248.1 mm -->
<!-- ipad height = 280.6mm -->
@ -390,11 +390,11 @@
<img class="device-on-hover" src="assets/hero/pdf_ipad.png" style="height: 100%; left: 60%; bottom: 0%;">
<img class="device-on-hover" src="assets/hero/web_iphone.png" style="height: 57.27%; left: 2%; bottom: 0%;">
</div>
<p style="margin-top: 2em;">提供网页版和 PDF 版，兼容 PC、平板和手机，随时随地阅读</p>
<p style="margin: 2em auto;">提供网页版和 PDF 版，兼容 PC、平板和手机，随时随地阅读</p>
<div class="text-button-container">
<a href="https://github.com/krahets/hello-algo/releases">
<div class="text-button">
<p>下载 PDF</p>
<span>下载 PDF</span>
<svg xmlns="http://www.w3.org/2000/svg"
viewBox="0 0 320 512"><!--!Font Awesome Free 6.5.1 by @fontawesome - https://fontawesome.com License - https://fontawesome.com/license/free Copyright 2024 Fonticons, Inc.-->
<path
@ -410,7 +410,7 @@
<section data-md-color-scheme="slate" data-md-color-primary="grey" class="home-div">
<div class="section-content">
<h3 style="text-align: center; margin: 1em auto;">推荐语</h3>
<div class="intro-container" style="margin-bottom: 1em;">
<div class="intro-container" style="margin: 0 auto;">
<div class="intro-text endor-text">
<p style="margin-bottom: 0;">“一本通俗易懂的数据结构与算法入门书，引导读者手脑并用地学习，强烈推荐算法初学者阅读。”</p>
<p style="font-weight: bold;">—— 邓俊辉，清华大学计算机系教授</p>

2
search/search_index.json
View File

File diff suppressed because one or more lines are too long

208
sitemap.xml
Unescape View File

@ -2,522 +2,522 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/contribution/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/installation/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/terminology/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/array/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/list/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/ram_and_cache/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/backtracking_algorithm/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/n_queens_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/permutations_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/subset_sum_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/iteration_and_recursion/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/basic_data_types/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/character_encoding/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/number_encoding/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/binary_search_recur/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/build_binary_tree_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/divide_and_conquer/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_divide_and_conquer/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/dp_problem_features/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/dp_solution_pipeline/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/edit_distance_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/intro_to_dynamic_programming/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/knapsack_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_dynamic_programming/unbounded_knapsack_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_operations/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_traversal/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/fractional_knapsack_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/greedy_algorithm/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/max_capacity_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/max_product_cutting_problem/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_greedy/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_algorithm/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_collision/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_map/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/build_heap/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/heap/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/top_k/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/what_is_dsa/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/about_the_book/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/suggestions/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_reference/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search_edge/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/binary_search_insertion/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/replace_linear_by_hashing/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/searching_algorithm_revisited/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bubble_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bucket_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/counting_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/heap_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/insertion_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/merge_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/quick_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/radix_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/selection_sort/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/sorting_algorithm/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/deque/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/queue/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/stack/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/array_representation_of_tree/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/avl_tree/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_search_tree/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree_traversal/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/summary/</loc>
<lastmod>2024-01-23</lastmod>
<lastmod>2024-01-24</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
sitemap.xml.gz
View File

Binary file not shown.

17
stylesheets/extra.css
Unescape View File

@ -204,7 +204,7 @@ body {
background-color: var(--md-default-bg-color);
color: var(--md-default-fg-color);
font-size: 0.9rem;
padding: 2em;
padding: 3em 2em;
text-align: center;
}
@ -221,7 +221,7 @@ body {
justify-content: center;
border-radius: 10em;
margin: 0 0.1em;
padding: 0.5em 1.3em;
padding: 0.6em 1.3em;
border: none;
background-color: var(--md-typeset-btn-color);
color: var(--md-primary-fg-color) !important;
@ -234,9 +234,10 @@ body {
background-color: var(--md-typeset-btn-hover-color);
}
.rounded-button p {
.rounded-button span {
margin: 0;
margin-bottom: 0.1em;
margin-bottom: 0.07em;
white-space: nowrap;
}
.rounded-button svg {
@ -257,18 +258,22 @@ body {
}
.text-button {
width: 100%;
display: flex;
flex-direction: row;
align-items: center;
color: var(--md-typeset-btn-color);
text-decoration: none;
margin: 0 1em;
}
.text-button:hover {
text-decoration: underline;
}
.text-button span {
white-space: nowrap;
}
.text-button svg {
display: inline-block;
fill: var(--md-typeset-btn-color);
@ -288,7 +293,7 @@ body {
padding: 0;
position: relative;
color: white;
font-size: min(2vh, 2.5vw);
font-size: min(1.8vh, 2.5vw);
font-weight: 500;
}

1
tencent18169509575544991012.txt
Unescape View File

@ -1 +0,0 @@
11359606726185580714
Write Preview
Loading…
Cancel
Save