最長公共子序列 待研究

def lcs_len(a,b): c = [[0 for j in b] for i in a] for i in range(len(a)): for j in range(len(b)): if i==0 or j==0: continue if a[i]==b[j]: c[i][j] = c[i-1][j-1]+1 else: c[i][j] = max(c[i-1][j],c[i][j-

>>阅读原文<<