def longstr(s1, s2):
m = [[0] * (1 + len(s2)) for i in range(1 + len(s1))]
t, h = 0, 0
for i in range(1, 1 + len(s1)):
for j in range(1, 1 + len(s2)):
if
m[i][j] = m[i - 1][j - 1] + 1
if m[i][j] > t:
t = m[i][j]
else:
m[i][j] = 0
return s1[h - t:h]
pos(st):
print("子串出现位置: ")
start = 0
if len(st) > 0:
while True:
start = s2.find(st, start) #返回字符串s2中子串st出现的首字符索引,从索引start开始找,若找不到,则输出-1
if start == - 1:
break
print(start, end="/")
s1 = input("s1:")
s2 = input("s2:")
s =
print("最长共同子串: ", s)
pos(s)