实验九——最长公共子序列LCS算法

问题

给定序列 X=< x1,x2,…,xm> , Y=<y1,y2,…,yn>
求X和Yd最长公共子序列；

解析

Xi=< x1,x2,…,xi>
Yj=< y1,y2,…,yj>
Zk=< z1,z2,…,zk>
如果Zk是Xi和Yi的最长公共子序列

伪代码

源码

#include <stdio.h>
#include <string.h>


#define MAXLEN 30

void LCS(char *x, char *y, int m, int n, int a[][MAXLEN], int b[][MAXLEN]) {
	int i, j;
	for (i = 0; i <= m; i++)	a[i][0] = 0;
	for (j = 1; j <= n; j++)	b[0][j] = 0;
	for (i = 1; i <= m; i++) {
		for (j = 1; j <= n; j++) {
			if (x[i - 1] == y[j - 1]) {
				a[i][j] = a[i - 1][j - 1] + 1;
				b[i][j] = 1;
			}
			else if (a[i - 1][j] >= a[i][j - 1]) {
				a[i][j] = a[i - 1][j];
				b[i][j] = 3;
			}
			else {
				a[i][j] = a[i][j - 1];
				b[i][j] = 2;
			}

		}
	}
}

void PrintLCS(int b[][MAXLEN], char *x, int i, int j) {
	if (i == 0 || j == 0)	return;
	if (b[i][j] == 1) {
		PrintLCS(b, x, i - 1, j - 1);
		printf("%c", x[i - 1]);
	}
	else if (b[i][j] == 3)
		PrintLCS(b, x, i - 1, j);
	else
		PrintLCS(b, x, i, j - 1);
}

int main() {
	char x[MAXLEN] = { "AACDASDABDC" };
	char y[MAXLEN] = { "ACFSADDA" };
	int a[MAXLEN][MAXLEN],
		b[MAXLEN][MAXLEN];
	int m, n;
	m = strlen(x);
	n = strlen(y);

	LCS(x, y, m, n, a, b);
	PrintLCS(b, x, m, n);

	return 0;
}

运行结果

复杂度

O（mn)