题解 | #查找两个字符串a,b中的最长公共子串#

循环套循环

s1 = input()
s2 = input()
if len(s2)<len(s1):
    a=s1
    s1=s2
    s2=a
tes=''
for i in range(len(s1)):
    if s1[i] in s2:
        for j in range(i + 1, len(s1)+1):
            if s1[i:j] in s2 and len(s1[i:j])>len(tes):
                tes=s1[i:j]
print(tes)