OSDN Git Service
(root)
/
oi-wiki
/
main.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
cd7ea4d
)
添加作者
author
fudonglai
<347761683@qq.com>
Thu, 25 Apr 2019 05:12:35 +0000
(13:12 +0800)
committer
fudonglai
<347761683@qq.com>
Thu, 25 Apr 2019 05:12:35 +0000
(13:12 +0800)
docs/basic/divide-and-conquer.md
patch
|
blob
|
history
diff --git
a/docs/basic/divide-and-conquer.md
b/docs/basic/divide-and-conquer.md
index
3a338aa
..
4363ff0
100644
(file)
--- a/
docs/basic/divide-and-conquer.md
+++ b/
docs/basic/divide-and-conquer.md
@@
-213,3
+213,7
@@
void merge_sort(一个数组) {
好了,这个算法也就这样了,完全没有任何难度。记住之前说的,相信函数的能力,传给他半个数组,那么这半个数组就已经被排好了。而且你会发现这不就是个二叉树遍历模板吗?为什么是后序遍历?因为我们分治算法的套路是 **分解 -> 解决(触底) -> 合并(回溯)** 啊,先左右分解,再处理合并,回溯就是在退栈,就相当于后序遍历了。至于`merge`函数,参考两个有序链表的合并,简直一模一样。
LeetCode 上有分治算法的专项练习,[点这里去做题](https://leetcode.com/tag/divide-and-conquer/)
+
+
+
+本文主要贡献者:[fudonglai](https://github.com/fudonglai)
\ No newline at end of file