题解 | #公共子串计算#

解题思路：
双指针，穷举法，判断

def test(S1,S2):
    len1 = len(S1)
    len2 = len(S2)

    i = 0
    j = 1
    count = 0
    while i+j<len1+1: 
        if S1[i:i+j] in S2:
            j += 1
        else:
            i += 1 
    return j-1

while 1:
    try:        
        S1 = input()
        S2 = input()
        n = test(S1,S2)
        print(n)
    except:
        break