最长公共子序列问题-求所有公共子序列（java核心代码实现）

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class LCS  {


int C[][];
char B[][];
Set<String> LCS_SET = new HashSet<String>();   //使用集合去重


public int LCS_L(char X[], char Y[]) {     
int m = X.length;
int n = Y.length;
C = new int[X.length][Y.length];
B = new char[X.length][Y.length];
for (int i = 0; i < m; i++) {
C[i][0] = 0;
}
for (int j = 1; j < n; j++) {
C[0][j] = 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] = 'x';
} else if (C[i - 1][j] > C[i][j - 1]) {
C[i][j] = C[i - 1][j];
B[i][j] = 'u';
} else if (C[i - 1][j] < C[i][j - 1]) {
C[i][j] = C[i][j - 1];
B[i][j] = 'l';
} else {
C[i][j] = C[i - 1][j];
B[i][j] = 'e';
}
}
}
return C[m - 1][n - 1];
}


public void LCS_Output(char Direction[][], char X[], int i, int j, int len,
char LCS[]) {
if (i == 0 || j == 0) {
LCS_SET.add(String.valueOf(LCS));
return;
}
if (B[i][j] == 'x') {
LCS[len - 1] = X[i];
len--;
LCS_Output(B, X, i - 1, j - 1, len, LCS);
} else if (B[i][j] == 'u') {
LCS_Output(B, X, i - 1, j, len, LCS);
} else if (B[i][j] == 'l') {
LCS_Output(B, X, i, j - 1, len, LCS);
} else if (B[i][j] == 'e') {
LCS_Output(B, X, i - 1, j, len, LCS);
LCS_Output(B, X, i, j - 1, len, LCS);
}
}

}

运行结果