求两个字符串的最长公共子串(python版)

str_a = "linmo,test.ok"
str_b = "linmo.test.yes"
tmp = []
# 遍历：从最长的开始
for i in range(len(str_a), 0, -1):
    for j in range(len(str_a) + 1 - i):
        sub = str_a[j:j + i]
		# 得到子串，判断其是否在str_b中
        if sub in str_b:
            tmp.append(sub)
	# 找到公共子串，跳出外层循环
    if tmp:
        break
print(tmp)

End