算法导论-动态规划

https://blog.csdn.net/gqtcgq/article/details/45530443 动态规划

https://www.cnblogs.com/mengwang024/p/4342796.html 钢条切割问题

完美平方和 https://www.jianshu.com/p/b47f168e6a73 动态规划

https://blog.csdn.net/lihao21/article/details/6171223 回文数动态规划

https://blog.csdn.net/hk627989388/article/details/77726301 小朋友过桥

0 - 1背包问题

• 回溯法解决背包问题 https://blog.csdn.net/Double2hao/article/details/51733136

最大加号

http://www.cnblogs.com/grandyang/p/8679286.html

动态规划算法解最长公共子序列LCS问题（2011.12.13重写）最长公共子序列

删除数据赚取积分

https://blog.csdn.net/weixin_38739799/article/details/78720006

https://blog.csdn.net/baidu_36282128/article/details/78739769

动态规划-----两个字符串交叉组成第三个字符 http://blog.csdn.net/smallfish_love/article/details/52277838 失效

https://www.cnblogs.com/twoheads/p/10838065.html 好理解

https://blog.csdn.net/weixin_38169413/article/details/82557211

https://blog.csdn.net/cyp331203/article/details/42965237 矩阵相乘 切钢条对比

【动态规划】求数组不相邻元素之和最大

https://blog.csdn.net/program_developer/article/details/83592202

矩阵相乘

https://www.cnblogs.com/Anker/archive/2013/03/10/2952475.html

剪绳子，乘积最大

https://www.it610.com/article/1294879831837712384.htm

dp[i]=max(max(j(i-j),jdp[i-j])) // j>=1 && j

彻底理解0-1背包 https://blog.csdn.net/chanmufeng/article/details/82955730

牛能和牛可乐的礼物，评分礼物，差值最小

https://www.nowcoder.com/practice/6c5c3a9901ec4a90aa140348243da4e8?tpId=110&&tqId=33430&rp=1&ru=/ta/job-code&qru=/ta/job-code/question-ranking

最大连续子序列和 https://www.cnblogs.com/cstdio1/p/10983055.html

最大连续K子序列和 https://www.nowcoder.com/practice/295c359d60b9469c8392d8fcb402f66c?tpId=110&tags=&title=&diffculty=0&judgeStatus=0&rp=1