public class LcsLength {
//动态规划
public static void main(String[] args) {
int []x= {1,2,3,5,6,7,8};
int []y= {4,5,6,7,8,9,10};
int m=x.length-1;
int n=y.length-1;
int [][]b=new int[10][10];
System.out.println("最大公共子序列长度为"+LcsLength(x,y,b));
System.out.println("最大公共子序列为");
lcs(m,n,x,b);
}
//计算最长公共子序列的长度
public static int LcsLength(int []x,int []y, int [][]b) {
int m=x.length-1;
int n=y.length-1;
int [][]c=new int[m+1][n+1];
for(int i=1;i<=m;i++) c[i][0]=0;
for(int i=1;i<=n;i++) c[0][i]=0;
for(int i=1;i<=m;i++) {
for(int j=1;j<=n;j++) {
if(x[i]==y[j]) {
c[i][j]=c[i-1][j-1]+1;
b[i][j]=1;
}
else if(c[i-1][j]>=c[i][j-1]) {
c[i][j]=c[i-1][j];
b[i][j]=2;
}
else {
c[i][j]=c[i][j-1];
b[i][j]=3;
}
}
}
return c[m][n];
}
//打印最长公共子序列
public static void lcs(int i,int j,int []x,int [][]b) {
if(i==0||j==0)return;
if(b[i][j]==1) {
lcs(i-1,j-1,x,b);
System.out.println(x[i]);
}
else if(b[i][j]==2) lcs(i-1,j,x,b);
else lcs(i,j-1,x,b);
}
}
11-01
964
07-25
1万+
03-09
545