标签：div 链接 oop turn span strong ring loop com
最长公共子序列(LCS)
思路：
代码：
def LCS(string1,string2): len1 = len(string1) len2 = len(string2) res = [[0 for i in range(len1+1)] for j in range(len2+1)] for i in range(1,len2+1): for j in range(1,len1+1): if string2[i-1] == string1[j-1]: res[i][j] = res[i-1][j-1]+1 else: res[i][j] = max(res[i-1][j],res[i][j-1]) return res,res[-1][-1] print(LCS("helloworld","loop"))
最长公共子串
思路：
代码：
def LCstring(string1,string2): len1 = len(string1) len2 = len(string2) res = [[0 for i in range(len1+1)] for j in range(len2+1)] result = 0 for i in range(1,len2+1): for j in range(1,len1+1): if string2[i-1] == string1[j-1]: res[i][j] = res[i-1][j-1]+1 result = max(result,res[i][j]) return result print(LCstring("helloworld","loop"))
链接：https://blog.csdn.net/ggdhs/article/details/90713154
标签：div 链接 oop turn span strong ring loop com
原文地址：https://www.cnblogs.com/fighting25/p/11507496.html
