def LCS(A,B): n = len(A) m = len(B) A.insert(0,'0') B.insert(0,'0') c = [([0]*(m+1)) for i in range(n+1)] b = [([0]*(m+1)) for i in range(n+1)] for i in range(0,n+1): for j in range(0,m+1): if (i==0 or j==0)
时间: 2024-03-01 22:49:31 浏览: 49
: c[i][j]=0 elif A[i]==B[j]: c[i][j]=c[i-1][j-1]+1 b[i][j]='↖' elif c[i-1][j]>=c[i][j-1]: c[i][j]=c[i-1][j] b[i][j]='↑' else: c[i][j]=c[i][j-1] b[i][j]='←' return c,b
这段代码实现了什么功能?