14. Longest Common Prefix leetcode Python 2016 new Season

最新推荐文章于 2024-01-22 08:26:35 发布

原创最新推荐文章于 2024-01-22 08:26:35 发布 · 365 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 同时被 2 个专栏收录

166 篇文章

订阅专栏

2016刷题

45 篇文章

订阅专栏

本文介绍了一个函数，用于在一组字符串中找到最长公共前缀。通过比较所有字符串的首字母并逐步缩小范围，最终返回最长公共前缀。

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

to compare all the strings assume the longest_prefix's length is m and there are n strings. we will need at least o(mn) time.

class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if not strs:
            return ''
        longest_string = min(strs)
        for index in range(len(longest_string)):
            for string in strs:
                if longest_string[index] != string[index]:
                    return longest_string[:index] if index > 0 else ''
        return longest_string