摘要： https://leetcode.com/problems/interleaving-string/discuss/31879/My-DP-solution-in-C++ 阅读全文

摘要： https://leetcode.com/problems/distinct-subsequences/discuss/37327/Easy-to-understand-DP-in-Java 如果S[i]==T[j]，那么dp[i][j] = dp[i-1][j-1] + dp[i-1][j]。意思 阅读全文