HJ65 查找两个字符串a,b中的最长公共子串

s1,s2 = input(),input()
l1,l2 = len(s1),len(s2)
if l2<l1:
    s1,s2 = s2,s1
    l1,l2 = l2,l1
dp = [[0 for i in range(l2+1)] for j in range(l1+1)]
res =""
sLen = 0
for i in range(l1):
    for j in range(l2):
        if s1[i]==s2[j]:
            dp[i+1][j+1] = dp[i][j]+1
            if dp[i+1][j+1]>sLen:
                sLen = dp[i+1][j+1]
                res = s1[i+1-sLen:i+1]
print(res)