leetcode中一些經典動態規劃題（不按期更新）

115. Distinct Subsequences 狀態轉移方程： d p [ i ] [ j ] = { d p [ i ] [ j − 1 ] , s [ j ] ! = t [ i ] d p [ i ] [ j − 1 ] + d p [ i − 1 ] [ j − 1 ] , s [ j ] = = t [ i ] dp[i][j]=\begin{cases} dp[i][j - 1]

>>阅读原文<<