相关题目
最大连续子序列和
dp[i] 表示以a[i]结尾的子序列最大和,那么状态转移方程为:dp[i] = max(a[i], dp[i-1] + a[i])上台阶问题
有一段楼梯有N级台阶,规定每一步只能跨一级或两级,要登上第N级台阶有几种不同的走法?
dp[i] 表示i级台阶的走法数量,那么 dp[i] = dp[i-1] + dp[i-2];
正则匹配
https://leetcode.com/problems/regular-expression-matching/discuss/5684/9-lines-16ms-c-dp-solutions-with-explanations
https://articles.leetcode.com/regular-expression-matching/ (递归)
相关博文
https://blog.csdn.net/trochiluses/article/details/37966729
https://blog.csdn.net/zjkc050818/article/details/74532023
https://www.zhihu.com/question/23995189 (推荐)