def searchstring(s,t):
    result={}
    for i in range((len(s)-1):
        for k in range(len(s)-1,-1,-1):
            if s[i:k+1] in t:
                result.setdefault(\’index %s–%s\’%(i,k),s[i:k+1])
    longest=max(len(i) for i in re[……]

更多