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
2019-04-21 10:36:08 +08:00
parent fb73f5cbbe
commit 0494398a34
68 changed files with 136 additions and 136 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
docs/notes/Leetcode 题解 - 动态规划.md
View File

@ -1,4 +1,4 @@
<div class="toc"><!-- GFM-TOC -->
<!-- GFM-TOC -->
* [斐波那契数列](#斐波那契数列)
* [爬楼梯](#爬楼梯)
* [强盗抢劫](#强盗抢劫)
@ -40,7 +40,7 @@
* [删除两个字符串的字符使它们相等](#删除两个字符串的字符使它们相等)
* [编辑距离](#编辑距离)
* [复制粘贴字符](#复制粘贴字符)
<!-- GFM-TOC --></div>
<!-- GFM-TOC -->
递归和动态规划都是将原问题拆成多个子问题然后求解，他们之间最本质的区别是，动态规划保存了子问题的解，避免重复计算。