题解 | #公共子串计算#
公共子串计算
https://www.nowcoder.com/practice/98dc82c094e043ccb7e0570e5342dd1b
s1 = input()
s2 = input()
maxl = 0
if len(s1) > len(s2):
s1, s2 = s2, s1
for i in range(len(s1)):
for j in range(len(s1), i, -1):
if s1[i:j] in s2:
maxl = max(maxl, len(s1[i:j]))
print(maxl)
# HJ85 最长回文子串
