1.问题描述:
公共子序列:
例如:acegs,cehkig中ceg为公共子序列,即子序列并不要求字符相连
2.求解算法:
母串:X=
<x1x2x3x4x5...xm>
<script type="math/tex" id="MathJax-Element-300">
</script> Y=
<y1y2y3y4y5...yn>
<script type="math/tex" id="MathJax-Element-301">
</script>, 求LCS和最长公共子串
a.暴力法:在X中找出所有子序列,匹配在Y中是否存在,复杂度O(n*2^m)
b.动态规划:dp[i][j]记录从i到j的子序列长度
代码实现:
public static int lcs(String str1, String str2) {
int len1 = str1.length();
int len2 = str2.length();
int dp[][] = new int[len1+1][len2+1];
for (int i = 0; i <= len1; i++) {
for( int j = 0; j <= len2; j++) {
if(i == 0 || j == 0) {
dp[i][j] = 0;
} else if (str1.charAt(i-1) == str2.charAt(j-1)) {
dp[i][j] = dp[i-1][j-1] + 1;
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
return dp[len1][len2];
}
3.求解最长公共子串
最长公共子串是最长公共子序列的特例,同理动态规划
代码实现:
public static int lcs(String str1, String str2) {
int len1 = str1.length();
int len2 = str2.length();
int result = 0; //记录最长公共子串长度
int dp[][] = new int[len1+1][len2+1];
for (int i = 0; i <= len1; i++) {
for( int j = 0; j <= len2; j++) {
if(i == 0 || j == 0) {
dp[i][j] = 0;
} else if (str1.charAt(i-1) == str2.charAt(j-1)) {
dp[i][j] = dp[i-1][j-1] + 1;
result = max(dp[i][j], result);
} else {
dp[i][j] = 0;
}
}
}
return result;
}