動態龜化連載

兩個字符串最長字串: d p [ i ] [ j ] = { d p [ i − 1 ] [ j − 1 ] + 1 s 1 [ i ] = = s 2 [ j ] 0 s 1 [ i ] ! = s 2 [ j ] dp[i][j] = \begin{cases} dp[i-1][j-1] + 1 & s_1[i]==s_2[j] \\ 0 & s_1[i] !=s_2[j] \end{case

>>阅读原文<<