1. 动态规划法
模型:F(m,n)表示 (str1从某个下标到第m个,str2从某个下标到第n个)为止(分别还要包括第m个和第n个)的 最长的连续公共字串长度
F(m,n) = 0 //str1[m] != str2[n]
F(m,n) = max(F(m-1,n),F(m,n-1),F(m-1,n-1)+1) //str1[m] == str2[n]
模型:F(m,n)表示 (str1从某个下标到第m个,str2从某个下标到第n个)为止(分别还要包括第m个和第n个)的 最长的连续公共字串长度
F(m,n) = 0 //str1[m] != str2[n]
F(m,n) = max(F(m-1,n),F(m,n-1),F(m-1,n-1)+1) //str1[m] == str2[n]