【动态规划】求解最长公共子序列

以下是求解最长公共子序列的python代码 

#输入数据
X=['A','B','C','B','D','A','B']
Y=['B','D','C','A','B','A']
m=len(X)
n=len(Y)
#计算各子问题的解，即求解c、b矩阵
import numpy as np
c=np.zeros([m+1,n+1],int)
b=np.zeros([m+1,n+1],(str,10))
for i in range(m):
    c[i,0]=0
for j in range(n):
    c[0,j]=0
for i in range(0,m):
    for j in range(0,n):
        if X[i]==Y[j]:
            c[i+1,j+1]=c[i,j]+1
            b[i+1,j+1]='topleft'
        elif c[i,j+1]>=c[i+1,j]:
            c[i+1,j+1]=c[i,j+1]
            b[i+1,j+1]='top'
        else:
                c[i+1,j+1]=c[i+1,j]
                b[i+1,j+1]='left'
print(c)
print(b)
#构造LCS
def LCS(b,X,i,j):
    if i==0 or j==0:
        return()
    if b[i,j]=='topleft':
        LCS(b,X,i-1,j-1)
        print(X[i-1])
    elif b[i,j]=='top':
        LCS(b,X,i-1,j)
    else:
        LCS(b,X,i,j-1)
LCS(b,X,m,n)

 以下是求解矩阵连乘的python代码