Lintcode 78. Longest Common Prefix (Medium) (Python)

最新推荐文章于 2020-06-03 05:27:45 发布

原创最新推荐文章于 2020-06-03 05:27:45 发布 · 148 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Lintcode #Python

Lintcode刷题专栏收录该内容

82 篇文章

订阅专栏

本文介绍了一种寻找多个字符串中最长公共前缀的方法，并提供了一个简单的Python实现案例。该算法适用于需要快速查找字符串集合中公共部分的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Longest Common Prefix

Description:

Given k strings, find the longest common prefix (LCP).

Example
For strings “ABCD”, “ABEF” and “ACEF”, the LCP is “A”

For strings “ABCDEFG”, “ABCEFG” and “ABCEFA”, the LCP is “ABC”

Code:

class Solution:
    """
    @param strs: A list of strings
    @return: The longest common prefix
    """
    def longestCommonPrefix(self, strs):
        # write your code here
        res = ""
        if not strs:
            return res
        minL = 0

        for i in strs:
            if not i:
                return res
            maxL = min(minL, len(i))

        for i in range(len(strs[0])):
            equ = True
            tmp = strs[0][i]
            for j in range(len(strs)):
                if strs[j][i]!=tmp:
                    equ = False
            if not equ:
                break
            res += strs[0][i]

        return res