leetcode 14: Longest Common Prefix

最新推荐文章于 2021-05-03 09:07:26 发布

原创最新推荐文章于 2021-05-03 09:07:26 发布 · 155 阅读

0 ·

CC 4.0 BY-SA版权

leetcode by python 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种算法，用于在一组字符串中找到最长的共同前缀。通过实例演示了如何使用该算法处理不同输入情况，如['flower','flow','flight']返回'fl'，['dog','racecar','car']则返回空字符串。适用于处理小写英文字符a-z的字符串。

摘要生成于 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:
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        strs.sort(key=len)
        prefix = strs[0] if strs else ''
        
        for x in strs[1:]:
            while not x.startswith(prefix):
                prefix=prefix[:-1]
        
        return prefix