数据结构--两字符串的最长公共子串

最新推荐文章于 2022-07-31 15:34:10 发布

Eyre_Chan

最新推荐文章于 2022-07-31 15:34:10 发布

阅读量400

点赞数

分类专栏：数据结构

本文链接：https://blog.csdn.net/weixin_41718056/article/details/99296747

版权

数据结构专栏收录该内容

42 篇文章 0 订阅

订阅专栏

返回子串长度

def findLongestCommonString(A, B):
    m = len(A)
    n = len(B)
    length = 0
    dp = [[0] * (n + 1) for i in range(m + 1)]
    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if A[i - 1] == B[j - 1]:
                dp[i][j] = dp[i - 1][j - 1] + 1
                if dp[i][j] > length:
                	length = dp[i][j]
            else:
                dp[i][j] = 0
    return length

返回子串长度，子串

def findLongestCommonString(A, B):
    m = len(A)
    n = len(B)
    length = 0
    str = ""
    dp = [[0] * (n + 1) for i in range(m + 1)]
    for i in range(1, m + 1):
        for j in range(1, n + 1):
            if A[i - 1] == B[j - 1]:
                dp[i][j] = dp[i - 1][j - 1] + 1
                if dp[i][j] > length:
	                length = dp[i][j]
	                str = A[i - length : i]
            else:
                dp[i][j] = 0
    return length, str