问题描述;
给定两个字符串,求解这两个字符串的最长公共子序列(Longest Common Sequence)。比如字符串1:BDCABA;字符串2:ABCBDAB
则这两个字符串的最长公共子序列长度为4,最长公共子序列是:BCBA
源代码:
private static void LCSLength(int m,int n,char X[],char Y[],int c[][],int b[][] ) {
int i,j;
for(i=1;i<=m;i++) c[i][0]=0;
for(i=1;i<=n;i++) c[0][i]=0;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++) {
if(X[i]==Y[j]) {
c[i][j]=c[i-1][j-1]+1;b[i][j]=1;
System.out.println
("[X"+i+",Y"+j+"]=[X"+(i-1)+",Y"+(j-1)+"]+1="+(c[i-1][j-1]+1));
System.out.print("当前子序列:");
LCS(i,j,X,b);System.out.println('\n');
}
else if(c[i-1][j]>=c[i][j-1]) {
c[i][j]=c[i-1][j];b[i][j]=2;
System.out.println
("[X"+i+",Y"+j+"]=[X"+(i-1)+",Y"+(j)+"]="+c[i-1][j]);
System.out.print("当前子序列:");
LCS(i,j,X,b);System.out.println('\n');
}
else {c[i][j]=c[i][j-1];b[i][j]=3;
System.out.println
("[X"+i+",Y"+j+"]=[X"+(i)+",Y"+(j-1)+"]="+c[i][j-1]);
System.out.print("当前子序列:");
LCS(i,j,X,b);System.out.println('\n');
}
}
}
private static void LCS(int i,int j,char X[],int b[][]) {
if(i==0||j==0) return;
if(b[i][j]==1) {LCS(i-1,j-1,X,b);System.out.print(X[i]+" ");}
else if(b[i][j]==2) LCS(i-1,j,X,b);
else LCS(i,j-1,X,b);
}
public static String show(char c[]) {
String s="";
for(int i=1;i<c.length;i++)
s+=c[i]+" ";
return s;
}
public static void main(String args[]) {
char X[]=new char[]{'0','A','B','C','B','D','A','B'};
char Y[]=new char[]{'0','B','D','C','A','B','A'};
int m=X.length;
int n=Y.length;
int c[][]=new int [m][n];
int b[][]=new int [m][n];
LCSLength(m-1,n-1,X,Y,c,b);
System.out.println("序列X: "+show(X));
System.out.println("序列Y: "+show(Y));
System.out.print("最长公共子序列为:");
LCS(m-1,n-1,X,b);
}