14. Longest Common Prefix

最新推荐文章于 2024-02-18 12:25:05 发布

原创最新推荐文章于 2024-02-18 12:25:05 发布 · 131 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode

leetcode 专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种在字符串数组中查找最长公共前缀的方法。通过示例演示了当输入为['flower','flow','flight']时，输出为'fl'；而当输入为['dog','racecar','car']时，由于没有共同前缀，输出为空字符串。文章提供了详细的Python代码实现。

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

"""
Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"
Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Note:

All given inputs are in lowercase letters a-z.
"""
class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if strs:
            s = strs[0]
            for i in strs[1::]:
                com = []
                count = 1
                for j in range(min(len(i), len(s))):
                    if i[j] == s[j]:
                        if count - j == 1:
                            com.append(i[j])
                            # count.append(j)
                            count += 1
                s = str(''.join(str(i) for i in com))
            return s
        else:
            return ""