如:有一个字符串 s1=‘test123456789’
另外一字符串 s2=‘ttttest123456789es’
需算法实现其最长公共子串为 test123456789 将其取出来
该算法应用广泛,解决正则表达式无法解决的问题。
def substr(s1,s2):
len1 = len(s1)+1
len2 = len(s2)+1
len3 = len(s1)
len4 = len(s2)
m = [[0 for j in range(len2)] for i in range(len1)] #注意len2 len1顺序不要搞错
maxNum = 0
p = 0
for i in range(len3):
for j in range(len4):
if s1[i] == s2[j]:
m[i + 1][j + 1] = m[i][j] + 1 #给相同字符赋值,值为左上角值加1
if m[i + 1][j + 1] > maxNum:
maxNum = m[i + 1][j + 1] #获取最大匹配长度
p = i + 1 #记录最大匹配长度的终止位置
return s1[p - maxNum : p], maxNum #返回最长子串及其长度
s1 = 'test123456'
s2 = 'ttttest123456789'
print(substr(s1,s2))
结果:(‘test123456’, 10)