github/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

deploy

Browse Source
This commit is contained in:
krahets 2023-05-18 17:17:41 +08:00
parent 31f1533b8f
commit 4cba4ae79a
6 changed files with 70 additions and 69 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
chapter_data_structure/summary/index.html
View File

@ -659,10 +659,10 @@
<li class="md-nav__item">
<a href="#351" class="md-nav__link">
3.5.1. &nbsp; 快速回顾
3.5.1. &nbsp; 知识回顾
</a>
<nav class="md-nav" aria-label="3.5.1. &nbsp; 快速回顾">
<nav class="md-nav" aria-label="3.5.1. &nbsp; 知识回顾">
<ul class="md-nav__list">
<li class="md-nav__item">
@ -1882,10 +1882,10 @@
<li class="md-nav__item">
<a href="#351" class="md-nav__link">
3.5.1. &nbsp; 快速回顾
3.5.1. &nbsp; 知识回顾
</a>
<nav class="md-nav" aria-label="3.5.1. &nbsp; 快速回顾">
<nav class="md-nav" aria-label="3.5.1. &nbsp; 知识回顾">
<ul class="md-nav__list">
<li class="md-nav__item">
@ -1938,7 +1938,7 @@
<h1 id="35">3.5. &nbsp; 小结<a class="headerlink" href="#35" title="Permanent link">&para;</a></h1>
<h2 id="351">3.5.1. &nbsp; 快速回顾<a class="headerlink" href="#351" title="Permanent link">&para;</a></h2>
<h2 id="351">3.5.1. &nbsp; 知识回顾<a class="headerlink" href="#351" title="Permanent link">&para;</a></h2>
<h3 id="_1">数据结构分类<a class="headerlink" href="#_1" title="Permanent link">&para;</a></h3>
<ul>
<li>数据结构可以从逻辑结构和物理结构两个角度进行分类。逻辑结构描述了数据元素之间的逻辑关系，而物理结构描述了数据在计算机内存中的存储方式。</li>

5
chapter_hashing/hash_map/index.html
View File

@ -2288,8 +2288,9 @@
</ol>
<p>以学生数据 <code>key 学号 -&gt; value 姓名</code> 为例，我们可以设计如下哈希函数：</p>
<div class="arithmatex">\[
f(x) = x \% 100
f(x) = x \bmod {100}
\]</div>
<p>其中 <span class="arithmatex">\(\bmod\)</span> 表示取余运算。</p>
<p><img alt="哈希函数工作原理" src="../hash_map.assets/hash_function.png" /></p>
<p align="center"> Fig. 哈希函数工作原理 </p>
@ -3129,7 +3130,7 @@ f(x) = x \% 100
</div>
</div>
<h2 id="713">7.1.3. &nbsp; 哈希冲突<a class="headerlink" href="#713" title="Permanent link">&para;</a></h2>
<p>细心的你可能已经注意到，<strong>在某些情况下，哈希函数 <span class="arithmatex">\(f(x) = x % 100\)</span> 可能无法正常工作</strong>。具体来说，当输入的 key 后两位相同时，哈希函数的计算结果也会相同，从而指向同一个 value 。例如，查询学号为 <span class="arithmatex">\(12836\)</span> 和 <span class="arithmatex">\(20336\)</span> 的两个学生时，我们得到：</p>
<p>细心的你可能已经注意到，<strong>在某些情况下，哈希函数 <span class="arithmatex">\(f(x) = x \bmod 100\)</span> 可能无法正常工作</strong>。具体来说，当输入的 key 后两位相同时，哈希函数的计算结果也会相同，从而指向同一个 value 。例如，查询学号为 <span class="arithmatex">\(12836\)</span> 和 <span class="arithmatex">\(20336\)</span> 的两个学生时，我们得到：</p>
<div class="arithmatex">\[
f(12836) = f(20336) = 36
\]</div>

4
chapter_sorting/radix_sort/index.html
View File

@ -1912,9 +1912,9 @@
<p>下面来剖析代码实现。对于一个 <span class="arithmatex">\(d\)</span> 进制的数字 <span class="arithmatex">\(x\)</span> ，要获取其第 <span class="arithmatex">\(k\)</span> 位 <span class="arithmatex">\(x_k\)</span> ，可以使用以下计算公式：</p>
<div class="arithmatex">\[
x_k = \lfloor\frac{x}{d^{k-1}}\rfloor \mod d
x_k = \lfloor\frac{x}{d^{k-1}}\rfloor \bmod d
\]</div>
<p>其中 <span class="arithmatex">\(\lfloor a \rfloor\)</span> 表示对浮点数 <span class="arithmatex">\(a\)</span> 向下取整，而 <span class="arithmatex">\(\mod d\)</span> 表示对 <span class="arithmatex">\(d\)</span> 取余。对于学号数据，<span class="arithmatex">\(d = 10\)</span> 且 <span class="arithmatex">\(k \in [1, 8]\)</span> 。</p>
<p>其中 <span class="arithmatex">\(\lfloor a \rfloor\)</span> 表示对浮点数 <span class="arithmatex">\(a\)</span> 向下取整，而 <span class="arithmatex">\(\bmod \space d\)</span> 表示对 <span class="arithmatex">\(d\)</span> 取余。对于学号数据，<span class="arithmatex">\(d = 10\)</span> 且 <span class="arithmatex">\(k \in [1, 8]\)</span> 。</p>
<p>此外，我们需要小幅改动计数排序代码，使之可以根据数字的第 <span class="arithmatex">\(k\)</span> 位进行排序。</p>
<div class="tabbed-set tabbed-alternate" data-tabs="1:10"><input checked="checked" id="__tabbed_1_1" name="__tabbed_1" type="radio" /><input id="__tabbed_1_2" name="__tabbed_1" type="radio" /><input id="__tabbed_1_3" name="__tabbed_1" type="radio" /><input id="__tabbed_1_4" name="__tabbed_1" type="radio" /><input id="__tabbed_1_5" name="__tabbed_1" type="radio" /><input id="__tabbed_1_6" name="__tabbed_1" type="radio" /><input id="__tabbed_1_7" name="__tabbed_1" type="radio" /><input id="__tabbed_1_8" name="__tabbed_1" type="radio" /><input id="__tabbed_1_9" name="__tabbed_1" type="radio" /><input id="__tabbed_1_10" name="__tabbed_1" type="radio" /><div class="tabbed-labels"><label for="__tabbed_1_1">Java</label><label for="__tabbed_1_2">C++</label><label for="__tabbed_1_3">Python</label><label for="__tabbed_1_4">Go</label><label for="__tabbed_1_5">JavaScript</label><label for="__tabbed_1_6">TypeScript</label><label for="__tabbed_1_7">C</label><label for="__tabbed_1_8">C#</label><label for="__tabbed_1_9">Swift</label><label for="__tabbed_1_10">Zig</label></div>
<div class="tabbed-content">

2
search/search_index.json
View File

File diff suppressed because one or more lines are too long

118
sitemap.xml
View File

@ -2,297 +2,297 @@
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
<url>
<loc>https://www.hello-algo.com/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/contribution/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_appendix/installation/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/array/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/linked_list/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/list/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_array_and_linkedlist/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/backtracking_algorithm/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/n_queens_problem/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_backtracking/permutations_problem/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_binary_search/binary_search/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/performance_evaluation/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/space_complexity/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_computational_complexity/time_complexity/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/basic_data_types/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/character_encoding/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/classification_of_data_structure/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/number_encoding/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_data_structure/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_operations/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/graph_traversal/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_graph/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_collision/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/hash_map/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_hashing/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/build_heap/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/heap/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_heap/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/algorithms_are_everywhere/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_introduction/what_is_dsa/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/about_the_book/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/suggestions/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_preface/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_reference/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/replace_linear_by_hashing/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/searching_algorithm_revisited/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_searching/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bubble_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/bucket_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/counting_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/insertion_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/merge_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/quick_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/radix_sort/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/sorting_algorithm/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_sorting/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/deque/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/queue/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/stack/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_stack_and_queue/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/array_representation_of_tree/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/avl_tree/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_search_tree/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/binary_tree_traversal/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
<url>
<loc>https://www.hello-algo.com/chapter_tree/summary/</loc>
<lastmod>2023-05-17</lastmod>
<lastmod>2023-05-18</lastmod>
<changefreq>daily</changefreq>
</url>
</urlset>

BIN
sitemap.xml.gz
View File

Binary file not shown.