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

deploy

Browse Source
This commit is contained in:
krahets
2023-07-16 04:19:01 +08:00
parent 54b99d13c8
commit dbf682ebc9
110 changed files with 25308 additions and 10305 deletions
Download Patch File Download Diff File Expand all files Collapse all files

301
chapter_reference/index.html
View File

@@ -1769,18 +1769,12 @@
<div class="md-nav__link md-nav__link--index ">
<a href="../chapter_backtracking/">12. &nbsp; &nbsp; 回溯</a>
<a href="../chapter_divide_and_conquer/">12. &nbsp; &nbsp; 分治</a>
<label for="__nav_13">
<span class="md-nav__icon md-icon"></span>
@@ -1791,7 +1785,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_13_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_13">
<span class="md-nav__icon md-icon"></span>
12. &nbsp; &nbsp; 回溯
12. &nbsp; &nbsp; 分治
</label>
<ul class="md-nav__list" data-md-scrollfix>
@@ -1803,8 +1797,8 @@
<li class="md-nav__item">
<a href="../chapter_backtracking/backtracking_algorithm/" class="md-nav__link">
12.1. &nbsp; 回溯算法
<a href="../chapter_divide_and_conquer/divide_and_conquer/" class="md-nav__link">
12.1. &nbsp; 分治算法（New）
</a>
</li>
@@ -1817,50 +1811,8 @@
<li class="md-nav__item">
<a href="../chapter_backtracking/permutations_problem/" class="md-nav__link">
12.2. &nbsp; 全排列问题
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_backtracking/subset_sum_problem/" class="md-nav__link">
12.3. &nbsp; 子集和问题
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_backtracking/n_queens_problem/" class="md-nav__link">
12.4. &nbsp; N 皇后问题
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_backtracking/summary/" class="md-nav__link">
12.5. &nbsp; 小结
<a href="../chapter_divide_and_conquer/build_binary_tree/" class="md-nav__link">
12.2. &nbsp; 构建树问题（New）
</a>
</li>
@@ -1903,17 +1855,13 @@
<div class="md-nav__link md-nav__link--index ">
<a href="../chapter_dynamic_programming/">13. &nbsp; &nbsp; 动态规划</a>
<a href="../chapter_backtracking/">13. &nbsp; &nbsp; 回溯</a>
<label for="__nav_14">
<span class="md-nav__icon md-icon"></span>
@@ -1924,7 +1872,7 @@
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_14_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_14">
<span class="md-nav__icon md-icon"></span>
13. &nbsp; &nbsp; 动态规划
13. &nbsp; &nbsp; 回溯
</label>
<ul class="md-nav__list" data-md-scrollfix>
@@ -1936,8 +1884,8 @@
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/intro_to_dynamic_programming/" class="md-nav__link">
13.1. &nbsp; 初探动态规划（New）
<a href="../chapter_backtracking/backtracking_algorithm/" class="md-nav__link">
13.1. &nbsp; 回溯算法
</a>
</li>
@@ -1950,8 +1898,8 @@
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/dp_problem_features/" class="md-nav__link">
13.2. &nbsp; DP 问题特性（New）
<a href="../chapter_backtracking/permutations_problem/" class="md-nav__link">
13.2. &nbsp; 全排列问题
</a>
</li>
@@ -1964,8 +1912,8 @@
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/dp_solution_pipeline/" class="md-nav__link">
13.3. &nbsp; DP 解题思路（New）
<a href="../chapter_backtracking/subset_sum_problem/" class="md-nav__link">
13.3. &nbsp; 子集和问题
</a>
</li>
@@ -1978,8 +1926,8 @@
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
13.4. &nbsp; 0-1 背包问题（New）
<a href="../chapter_backtracking/n_queens_problem/" class="md-nav__link">
13.4. &nbsp; N 皇后问题
</a>
</li>
@@ -1992,36 +1940,8 @@
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/unbounded_knapsack_problem/" class="md-nav__link">
13.5. &nbsp; 完全背包问题（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/edit_distance_problem/" class="md-nav__link">
13.6. &nbsp; 编辑距离问题（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/summary/" class="md-nav__link">
13.7. &nbsp; 小结（New）
<a href="../chapter_backtracking/summary/" class="md-nav__link">
13.5. &nbsp; 小结
</a>
</li>
@@ -2052,20 +1972,181 @@
<label class="md-nav__link" for="__nav_15" id="__nav_15_label" tabindex="0">
14. &nbsp; &nbsp; 附录
<span class="md-nav__icon md-icon"></span>
</label>
<div class="md-nav__link md-nav__link--index ">
<a href="../chapter_dynamic_programming/">14. &nbsp; &nbsp; 动态规划</a>
<label for="__nav_15">
<span class="md-nav__icon md-icon"></span>
</label>
</div>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_15_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_15">
<span class="md-nav__icon md-icon"></span>
14. &nbsp; &nbsp; 附录
14. &nbsp; &nbsp; 动态规划
</label>
<ul class="md-nav__list" data-md-scrollfix>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/intro_to_dynamic_programming/" class="md-nav__link">
14.1. &nbsp; 初探动态规划（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/dp_problem_features/" class="md-nav__link">
14.2. &nbsp; DP 问题特性（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/dp_solution_pipeline/" class="md-nav__link">
14.3. &nbsp; DP 解题思路（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/knapsack_problem/" class="md-nav__link">
14.4. &nbsp; 0-1 背包问题（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/unbounded_knapsack_problem/" class="md-nav__link">
14.5. &nbsp; 完全背包问题（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/edit_distance_problem/" class="md-nav__link">
14.6. &nbsp; 编辑距离问题（New）
</a>
</li>
<li class="md-nav__item">
<a href="../chapter_dynamic_programming/summary/" class="md-nav__link">
14.7. &nbsp; 小结（New）
</a>
</li>
</ul>
</nav>
</li>
<li class="md-nav__item md-nav__item--nested">
<input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_16" >
<label class="md-nav__link" for="__nav_16" id="__nav_16_label" tabindex="0">
15. &nbsp; &nbsp; 附录
<span class="md-nav__icon md-icon"></span>
</label>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_16_label" aria-expanded="false">
<label class="md-nav__title" for="__nav_16">
<span class="md-nav__icon md-icon"></span>
15. &nbsp; &nbsp; 附录
</label>
<ul class="md-nav__list" data-md-scrollfix>
@@ -2076,7 +2157,7 @@
<li class="md-nav__item">
<a href="../chapter_appendix/installation/" class="md-nav__link">
14.1. &nbsp; 编程环境安装
15.1. &nbsp; 编程环境安装
</a>
</li>
@@ -2090,7 +2171,7 @@
<li class="md-nav__item">
<a href="../chapter_appendix/contribution/" class="md-nav__link">
14.2. &nbsp; 一起参与创作
15.2. &nbsp; 一起参与创作
</a>
</li>
@@ -2118,7 +2199,7 @@
<input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_16" checked>
<input class="md-nav__toggle md-toggle " type="checkbox" id="__nav_17" checked>
@@ -2135,8 +2216,8 @@
</div>
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_16_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_16">
<nav class="md-nav" data-md-level="1" aria-labelledby="__nav_17_label" aria-expanded="true">
<label class="md-nav__title" for="__nav_17">
<span class="md-nav__icon md-icon"></span>
参考文献
</label>
@@ -2229,7 +2310,7 @@
<nav class="md-footer__inner md-grid" aria-label="页脚" >
<a href="../chapter_appendix/contribution/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 14.2. &amp;nbsp; 一起参与创作" rel="prev">
<a href="../chapter_appendix/contribution/" class="md-footer__link md-footer__link--prev" aria-label="上一页: 15.2. &amp;nbsp; 一起参与创作" rel="prev">
<div class="md-footer__button md-icon">
<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"><path d="M20 11v2H8l5.5 5.5-1.42 1.42L4.16 12l7.92-7.92L13.5 5.5 8 11h12Z"/></svg>
</div>
@@ -2238,7 +2319,7 @@
上一页
</span>
<div class="md-ellipsis">
14.2. &nbsp; 一起参与创作
15.2. &nbsp; 一起参与创作
</div>
</div>
</a>