最长公共子序列 Java实现

 

public class LCS {
    int[][] lcsLength(char[] x,char[] y){
    int m = x.length;
    int n = y.length;
    int i,j;
    int[][] c = new int[m][n];
    int[][] b = new int[m][n];
    for(i = 1;i < m;i++)
        c[i][0] = 0;
    for(j = 0;j < n;j++)
        c[0][j] = 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;
}
    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 b;
}

void printLCS(int[][] b,char[] x,int i,int j,int count){

    if(i == 0 || j == 0){
        System.out.println("最长子序列长度为："+count);
    return;
}

if(b[i][j] == 1){
    printLCS(b,x,i - 1,j - 1,count+1);
    System.out.print(x[i] + "");

}else if(b[i][j] == 2)
    printLCS(b,x,i - 1,j,count);
 else
    printLCS(b,x,i,j - 1,count);

}
public static void main(String[] args) {
    String s1="ACCGGTCGAGATGCAG";
    String s2="ACCGGTCGAGATGCAG";
    char[] x = s1.toCharArray();
    char[] y = s2.toCharArray();
    LCS lcs = new LCS();
    int count=0;
    lcs.printLCS(lcs.lcsLength(x, y), x, x.length-1, y.length-1,count);
}

}