最长公共子序列（java代码）

最长公共子序列

package w.dynamic.lcs;

public class The_longest_Subsquence {
    public static void main(String[] args){

        char[] x = {'W','A','N','G','Y','U','A','N','Y','I'};
        char[] y = {'S','W','A','N','G','P'};
        Find_Lcs(x,y);
    }

    public static int Lcs_length(char[] str1, char[] str2, int[][] c, int[][] b) {
        int len1 = str1.length;
        int len2 = str2.length;

        int i, j;
        for (i = 1; i <= len1; i++)
            c[i][0] = 0;

        for (j = 0; j <= len2; j++)
            c[0][j] = 0;

        for (i = 1; i <= len1; i++)
            for (j = 1; j <= len2; j++) {
                if (str1[i - 1] == str2[j - 1]) {
                    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[len1][len2];
    }
    public static void Print_Lcs(char[] str,int[][]b,int i,int j)
    {
        if(i==0||j==0)
            return ;
        if(b[i][j]==1)
        {
            Print_Lcs(str,b,i-1,j-1);
            System.out.print(str[i-1]);
        }
        else if(b[i][j]==2)
            Print_Lcs(str,b,i-1,j);
        else
            Print_Lcs(str,b,i,j-1);
    }
    public static void Find_Lcs(char[] str1,char[] str2)
    {
        int i,j,length;
        int len1=str1.length;
        int len2=str2.length;

        int[][]c=new int[len1+1][len2+1];
        int[][]b=new int[len1+1][len2+1];

        for(i=0;i<=len1;i++)
            for(j=0;j<=len2;j++)
            {
                c[i][j]=0;
                b[i][j]=0;
            }
        length=Lcs_length(str1,str2,c,b);
        System.out.println("the number of the Longest-Common-Subsequence: "+length);
        System.out.println("the longest-Common-Subsequence is:");
        Print_Lcs(str1,b,len1,len2);
    }
}