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

auto commit

Browse Source
This commit is contained in:
CyC2018
2020-11-17 00:32:18 +08:00
parent f5ad47b470
commit 7e61fc1360
380 changed files with 2371 additions and 46715 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
notes/算法 - 其它.md
View File

@ -1,4 +1,5 @@
# 汉诺塔
# 算法 - 其它
## 汉诺塔
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/69d6c38d-1dec-4f72-ae60-60dbc10e9d15.png" width="300"/> </div><br>
@ -6,15 +7,15 @@
这是一个经典的递归问题，分为三步求解：
① 将 n-1 个圆盘从 from -> buffer
① 将 n-1 个圆盘从 from -\> buffer
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/f9240aa1-8d48-4959-b28a-7ca45c3e4d91.png" width="300"/> </div><br>
② 将 1 个圆盘从 from -> to
② 将 1 个圆盘从 from -\> to
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/f579cab0-3d49-4d00-8e14-e9e1669d0f9f.png" width="300"/> </div><br>
③ 将 n-1 个圆盘从 buffer -> to
③ 将 n-1 个圆盘从 buffer -\> to
<div align="center"> <img src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/d02f74dd-8e33-4f3c-bf29-53203a06695a.png" width="300"/> </div><br>
@ -50,7 +51,7 @@ from H2 to H3
from H1 to H3
```
# 哈夫曼编码
## 哈夫曼编码
根据数据出现的频率对数据进行编码，从而压缩原始数据。
@ -126,10 +127,3 @@ public class Huffman {
}
}
```
<div align="center"><img width="320px" src="https://cs-notes-1256109796.cos.ap-guangzhou.myqcloud.com/githubio/公众号二维码-2.png"></img></div>