[DnA] 最长公共子字符串

方案：

def func(str1,str2):
    li = []

    len1 = len(str1)

    for i in range(0,len1):
        for j in range(i,len1):
            li.append(str1[i:j+1])

    maxlen = 0
    maxstr = ""
    for ele in li:
        if str2.__contains__(ele):
            if len(ele) > maxlen:
                maxlen = len(ele)
                maxstr = ele
    print(maxstr)

func("abcdefghijklmnop","abcsafjklmnopqrstuvw")