StarMirror/CS-Notes
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Update 算法.md

Browse Source
This commit is contained in:
luocaodan 2018-08-04 23:06:47 +08:00 committed by GitHub
parent e610e0fb10
commit cef2ed9ef8
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notes/算法.md
View File

@ -2050,7 +2050,7 @@ public class SparseVector {
如果只有一个圆盘，那么只需要进行一次移动操作。
从上面的讨论可以知道，n 圆盘需要移动 (n-1)+1+(n-1) = 2n-1 次。
从上面的讨论可以知道，a<sub>n</sub> = 2 * a<sub>n-1</sub> + 1，显然a<sub>n</sub> = 2<sup>n</sup> - 1，n 圆盘需要移动 2<sup>n</sup> - 1 次。
<div align="center"> <img src="../pics//54f1e052-0596-4b5e-833c-e80d75bf3f9b.png" width="300"/> </div><br>