题解 | 公共子串计算

import sys

s = input()
t = input()
def bigsub(s,t):
    lon = s if len(s)>=len(t) else t
    sho = t if len(s)>=len(t) else s
    if s == t:
        return len(s)
    distance = 0
    for i in range(len(sho)):
        for j in range(len(lon)):
            k =0
            while i+k <len(sho) and j+k <len(lon) and sho[i+k] == lon[j+k]:
                k +=1
            distance = max(distance,k)
    return distance

print(bigsub(s,t))