2023-07-16 04:18:52 +08:00
|
|
|
---
|
|
|
|
|
comments: true
|
2023-07-19 16:10:06 +08:00
|
|
|
icon: material/set-split
|
2023-07-17 18:38:48 +08:00
|
|
|
status: new
|
2023-07-16 04:18:52 +08:00
|
|
|
---
|
|
|
|
|
|
2023-08-19 22:07:27 +08:00
|
|
|
# 第 12 章 分治
|
2023-07-16 04:18:52 +08:00
|
|
|
|
2023-07-17 04:53:02 +08:00
|
|
|
<div class="center-table" markdown>
|
|
|
|
|
|
2023-07-29 04:48:28 +08:00
|
|
|
{ width="600" }
|
2023-07-17 04:53:02 +08:00
|
|
|
|
|
|
|
|
</div>
|
2023-07-17 17:51:03 +08:00
|
|
|
|
2023-08-03 04:37:52 +08:00
|
|
|
!!! abstract
|
|
|
|
|
|
2023-08-04 05:24:49 +08:00
|
|
|
难题被逐层拆解，每一次的拆解都使它变得更为简单。
|
2023-08-03 04:37:52 +08:00
|
|
|
|
2023-08-04 05:24:49 +08:00
|
|
|
分而治之揭示了一个重要的事实：从简单做起，一切都不再复杂。
|
2023-08-03 04:37:52 +08:00
|
|
|
|
2023-07-17 17:51:03 +08:00
|
|
|
## 本章内容
|
|
|
|
|
|
|
|
|
|
- [12.1 分治算法](https://www.hello-algo.com/chapter_divide_and_conquer/divide_and_conquer/)
|
|
|
|
|
- [12.2 分治搜索策略](https://www.hello-algo.com/chapter_divide_and_conquer/binary_search_recur/)
|
|
|
|
|
- [12.3 构建树问题](https://www.hello-algo.com/chapter_divide_and_conquer/build_binary_tree_problem/)
|
|
|
|
|
- [12.4 汉诺塔问题](https://www.hello-algo.com/chapter_divide_and_conquer/hanota_problem/)
|
2023-07-17 20:19:37 +08:00
|
|
|
- [12.5 小结](https://www.hello-algo.com/chapter_divide_and_conquer/summary/)
|
