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

Format C, C++, C#, Go, Java, Python, Rust code.

Browse Source
This commit is contained in:
krahets
2023-09-02 23:54:38 +08:00
parent b6ac6aa7d7
commit dd72335235
53 changed files with 152 additions and 154 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
docs/chapter_divide_and_conquer/hanota_problem.md
View File

@ -99,7 +99,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "Python"
@ -109,7 +109,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solve_hanota}
```
=== "Go"
@ -119,7 +119,7 @@
[class]{}-[func]{dfsHanota}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "JS"
@ -129,7 +129,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "TS"
@ -139,7 +139,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "C"
@ -149,7 +149,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "C#"
@ -169,7 +169,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "Zig"
@ -179,7 +179,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "Dart"
@ -189,7 +189,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solveHanota}
```
=== "Rust"
@ -199,7 +199,7 @@
[class]{}-[func]{dfs}
[class]{}-[func]{hanota}
[class]{}-[func]{solve_hanota}
```
如下图所示，汉诺塔问题形成一个高度为 $n$ 的递归树，每个节点代表一个子问题、对应一个开启的 `dfs()` 函数，**因此时间复杂度为 $O(2^n)$ ，空间复杂度为 $O(n)$** 。