动态规划理解及关键点总结：
对于线性dp：
1.理清逻辑，在理论上划分多种情况，此时可以不用想具体编码实现
2.当n=0，算出f(x)，当n=1，算出f（x）,进而列出动态方程
3.编码实现，用循环或者递归，可以用数组存储每个f(x)的值，以便获取f(x-n)的值
二叉树dp：从根节点出发
-
Notifications
You must be signed in to change notification settings - Fork 0
sundayong/lintcode-leetcode
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published