[LintCode]Longest Common Substring(Python)

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

gamesluo

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

阅读量525

点赞数 1

分类专栏： LintCode 文章标签： python

本文链接：https://blog.csdn.net/gamesluo/article/details/76735242

版权

LintCode 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

class Solution:
    # @param A, B: Two string.
    # @return: the length of the longest common substring.
    def longestCommonSubstring(self, A, B):
        # write your code here
        maxlength = len(A) + 1
        for i in range(maxlength)[::-1]:
            substrB = []
            for j in range(len(B) + 1 - i):
                substrB.append(B[j: j + i])
            for str in substrB:
                if A.find(str) != -1:
                    return i
        return 0