python 最长公共子序列

b[i][j]的三种情况：

b[i][j] = 1 x[i]和y[j]的最长公共子序列是由x[i-1]和y[j-1]的最长公共子序列在尾部加上x[i]得到（打印，朝左上方找）

b[i][j] = 2 x[i]和y[j]的最长公共子序列与x[i-1]和y[j]的最长公共子序列相同（朝上面找）

b[i][j] = 3 x[i]和y[j]的最长公共子序列与x[i]和y[j-1]的最长公共子序列相同（朝左边找）

'''
最长公共子序列
X = {A, B, C, B, D, A, B}
Y = {B, D, C, A, B, A}
X 和 Y 的最长公共子序列为{B, C, B, A}
c[i][j]: X[i],Y[j]的长度
B[i][j]: 记录三种情况
'''
def LCSLength(m, n, x, y, c, b):            #标记
    for i in range(m+1):
        for j in range(n+1):
            if x[i] == y[j]:
                c[i+1][j+1] = c[i][j] + 1
                b[i+1][j+1] = 1
            elif c[i][j+1] >= c[i+1][j]:
                c[i+1][j+1] = c[i][j+1]
                b[i+1][j+1] = 2
            else:
                c[i+1][j+1] = c[i+1][j]
                b[i+1][j+1] = 3


def LCS(i, j, x, b):                #从下往上找
    if i == 0 or j == 0:
        return
    if b[i][j] == 1:
        LCS(i-1, j-1, x, b)
        print(x[i-1], end='')
    elif b[i][j] == 2:
        LCS(i-1, j, x, b)
    else:
        LCS(i, j-1, x, b)


x = input().split()
m = len(x)
y = input().split()
n = len(y)
c = []
b = []
for i in range(m+1):
    c.append([])
    b.append([])
    for j in range(n+1):
        c[i].append(0)
        b[i].append(0)
LCSLength(m-1, n-1, x, y, c, b)
LCS(m, n, x, b)

测试样例：A B C B D A B
                  B D C A B A

  BCBA