"求两个字符串的最长公共子串"（python）

题目描述：找出两个字符串的最长公共子串。例如：‘abccade’与字符串'dgcadde'的最长公共子串为'cad'.

暴力解法就不写了，方法一：动态规划：

def getMaxSubStr(str1, str2):
    len1 = len(str1)
    len2 = len(str2)
    sb = ''
    maxs = 0  # 用来记录最长公共子串的长度
    maxI = 0  # 用来记录最长公共子串最后一个字符的位置
    # 申请新的空间来记录公共子串长度的信息
    M = [([None]*(len1 + 1)) for i in range(len2 + 1)]

    i = 0
    while i < len1 + 1:
        M[i][0] = 0
        i += 1

    j = 0
    while j < len2 + 1:
        M[0][j] = 0
        j += 1

    # 通过利用递归公式填写新建的二维数组（公共字串的长度信息）
    i = 1
    while i < len1 + 1:
        j = 1
        while j < len2 + 1:
            if list(str1)[i - 1] == list(str2)[j - 1]:
                M[i][j] = M[i - 1][j - 1] + 1
                if M[i][j] > maxs:
                    maxs = M[i][j]
                    maxI = i
            else:
                M[i][j] = 0
            j += 1
        i += 1

    # 找出公共字串
    i = maxI - maxs
    while i < maxI:
        sb = sb + list(str1)[i]
        i += 1

    return sb

if __name__ == "__main__":
    str1 = "abccade"
    str2 = "dgcadde"
    print(getMaxSubStr(str1, str2))

方法二：滑动比较法

def getMaxSubStr1(s1, s2):
    len1 = len(s1)
    len2 = len(s2)
    maxLen = 0
    tmpMaxLen = 0
    maxLenEnd1 = 0
    sb = ''
    i = 0
    while i < len1 + len2:
        s1begin = s2begin = 0
        tmpMaxLen = 0

        if i < len1:
            s1begin = len1 - i
        else:
            s2begin = i - len1

        j = 0
        while (s1begin + j < len1) and (s2begin + j < len2):
            if list(s1)[s1begin + j] == list(s2)[s2begin + j]:
                tmpMaxLen += 1
            else:
                if (tmpMaxLen > maxLen):
                    maxLen = tmpMaxLen
                    maxLenEnd1 = s1begin + j
                else:
                    tmpMaxLen = 0
            j += 1
        if tmpMaxLen > maxLen:
            maxLen = tmpMaxLen
            maxLenEnd1 = s1begin + j
            i += 1
        i = maxLenEnd1 - maxLen
        while i < maxLenEnd1:
            sb = sb + list(s1)[i]
            i += 1
        return sb