algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-01 11:29:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: Add the chapter of divide and conquer (#609)

Browse Source 
* Add the chapter of divide and conquer.
Add the section of divide and conquer algorithm.
Add the section of build tree problem.

* Update build_tree.py
This commit is contained in:
Yudong Jin
2023-07-16 04:24:04 +08:00
committed by GitHub
parent f5ea4fa1c6
commit 51a4c5089e
21 changed files with 342 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

38
mkdocs.yml
View File

@ -205,24 +205,28 @@ nav:
- 11.9.   计数排序: chapter_sorting/counting_sort.md
- 11.10.   基数排序: chapter_sorting/radix_sort.md
- 11.11.   小结: chapter_sorting/summary.md
- 12.     回溯:
- 12.     分治:
- chapter_divide_and_conquer/index.md
- 12.1.   分治算法（New）: chapter_divide_and_conquer/divide_and_conquer.md
- 12.2.   构建树问题（New）: chapter_divide_and_conquer/build_binary_tree.md
- 13.     回溯:
- chapter_backtracking/index.md
- 12.1.   回溯算法: chapter_backtracking/backtracking_algorithm.md
- 12.2.   全排列问题: chapter_backtracking/permutations_problem.md
- 12.3.   子集和问题: chapter_backtracking/subset_sum_problem.md
- 12.4.   N 皇后问题: chapter_backtracking/n_queens_problem.md
- 12.5.   小结: chapter_backtracking/summary.md
- 13.     动态规划:
- 13.1.   回溯算法: chapter_backtracking/backtracking_algorithm.md
- 13.2.   全排列问题: chapter_backtracking/permutations_problem.md
- 13.3.   子集和问题: chapter_backtracking/subset_sum_problem.md
- 13.4.   N 皇后问题: chapter_backtracking/n_queens_problem.md
- 13.5.   小结: chapter_backtracking/summary.md
- 14.     动态规划:
- chapter_dynamic_programming/index.md
- 13.1.   初探动态规划（New）: chapter_dynamic_programming/intro_to_dynamic_programming.md
- 13.2.   DP 问题特性（New）: chapter_dynamic_programming/dp_problem_features.md
- 13.3.   DP 解题思路（New）: chapter_dynamic_programming/dp_solution_pipeline.md
- 13.4.   0-1 背包问题（New）: chapter_dynamic_programming/knapsack_problem.md
- 13.5.   完全背包问题（New）: chapter_dynamic_programming/unbounded_knapsack_problem.md
- 13.6.   编辑距离问题（New）: chapter_dynamic_programming/edit_distance_problem.md
- 13.7.   小结（New）: chapter_dynamic_programming/summary.md
- 14.     附录:
- 14.1.   编程环境安装: chapter_appendix/installation.md
- 14.2.   一起参与创作: chapter_appendix/contribution.md
- 14.1.   初探动态规划（New）: chapter_dynamic_programming/intro_to_dynamic_programming.md
- 14.2.   DP 问题特性（New）: chapter_dynamic_programming/dp_problem_features.md
- 14.3.   DP 解题思路（New）: chapter_dynamic_programming/dp_solution_pipeline.md
- 14.4.   0-1 背包问题（New）: chapter_dynamic_programming/knapsack_problem.md
- 14.5.   完全背包问题（New）: chapter_dynamic_programming/unbounded_knapsack_problem.md
- 14.6.   编辑距离问题（New）: chapter_dynamic_programming/edit_distance_problem.md
- 14.7.   小结（New）: chapter_dynamic_programming/summary.md
- 15.     附录:
- 15.1.   编程环境安装: chapter_appendix/installation.md
- 15.2.   一起参与创作: chapter_appendix/contribution.md
- 参考文献:
- chapter_reference/index.md