python算法-1字符串-4Longest Common Substring最长公共子串

最新推荐文章于 2020-12-10 20:12:10 发布

jj_千寻

最新推荐文章于 2020-12-10 20:12:10 发布

阅读量299

点赞数

本文链接：https://blog.csdn.net/jiang425776024/article/details/107452171

版权

算法LeetCode 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

python算法-1字符串-4Longest Common Substring最长公共子串

在线运行：

https://pyleetcode.gitee.io/codes_html/SYL_1%E5%AD%97%E7%AC%A6%E4%B8%B2_10Longest%20Common%20Substring.html

def LCstring(string1, string2):
    len1 = len(string1)
    len2 = len(string2)
    res = [[0 for i in range(len1 + 1)] for j in range(len2 + 1)]
    result = 0
    # i or j =0时，res[i][j] =0
    # string1[i] = string2[j] 时，res[i][j] = res[i - 1][j - 1] + 1
    # string1[i] != string2[j] 时，res[i][j] = 0

    for i in range(1, len2 + 1):
        for j in range(1, len1 + 1):
            if string2[i - 1] == string1[j - 1]:
                # 以string1[i-1], string2[j-1]为结尾的最长公共子串，长度是 res[i][j]
                res[i][j] = res[i - 1][j - 1] + 1
                result = max(result, res[i][j])
    return result


print(LCstring("helloworld", "loop"))
# 输出结果为：2