记字符串Xi和Yj的LCS的长度为c[i,j](c[i][j] 代表了长度为i的X子串和长度为j的Y子串的LCS的长度),我们可以递归地求c[i,j]:
/ 0 if i<0 or j<0
c[i,j]= c[i-1,j-1]+1 if i,j>=0 and xi=xj
\ max(c[i,j-1],c[i-1,j] if i,j>=0 and xi≠xj
在求得矩阵c[i,j] 后,可以逆向求得LCS:当c[i,j] = c[i-1][j-1] + 1 时,则X[i] = Y[j] 是 LCS的一个字符。
//递归求得LCS的长度:c[i][j] 代表字符串a[0-i]和b[0-j]的LCS的长度
public static void LCS(char[] a, char[] b, ref int[][] c)
{
c = new int[a.Length][];
//初始化c[i][0]
for (int i = 0; i < a.Length; i++)
{
c[i] = new int[b.Length];
if (a[i] == b[0])
{
c[i][0] = 1;
}
else
{
c[i][0] = 0;
}
}
//初始化c[0][j]
for (int j = 0; j < b.Length; j++)
{
if (b[j] == a[0])
{
c[0][j] = 1;
}
else
{
c[0][j] = 0;
}
}
//递归求得LCS的长度:c[i][j]
for (int i = 1; i < a.Length; i++)
{
for (int j = 1; j < b.Length; j++)
{
if (a[i] == b[j])
{
c[i][j] = c[i - 1][j - 1] + 1;
}
else if (c[i - 1][j] >= c[i][j - 1])
{
c[i][j] = c[i - 1][j];
}
else
{
c[i][j] = c[i][j - 1];
}
}
}
}
//逆向根据c[i][j],求得一个LCS
public static void PrintLCS(char[] a, char[] b, int[][] c, int i, int j)
{
if (i == 0 || j == 0)
{
if (c[i][j] > 0)
{
Console.WriteLine("a[{0}]=b[{1}]={2}", i, j, a[i]);
}
return;
}
if (c[i][j] == c[i][j - 1])
{
PrintLCS(a, b, c, i, j - 1);
}
else if (c[i][j] == c[i - 1][j])
{
PrintLCS(a, b, c, i - 1, j);
}
else
{
Console.WriteLine("a[{0}]=b[{1}]={2}", i, j, a[i]);
PrintLCS(a, b, c, i - 1, j - 1);
}
}
static int Main(string[] args)
{
char[] a = "dfdsyacolrd".ToCharArray();
char[] b = "fiusatodrk".ToCharArray();
int[][] c = new int[a.Length][];
LCS(a, b, ref c);
for (int i = 0; i < a.Length; i++)
{
for (int j = 0; j < b.Length; j++)
{
Console.Write(c[i][j] + "");
}
Console.WriteLine("");
}
PrintLCS(a, b, c, a.Length - 1, b.Length - 1);
}