leetcode -- Longest Common Prefix -- 简单O(n^2)就行

最新推荐文章于 2024-10-01 05:04:32 发布

xyqzki

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量421

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/xyqzki/article/details/50224241

版权

leetcode 专栏收录该内容

257 篇文章 0 订阅

订阅专栏

https://leetcode.com/problems/longest-common-prefix/

class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """

        if len(strs) == 0: return ""

        base = strs[0]

        if base == "": return ""

        i = 0

        while i < len(base):

            for j in xrange(1, len(strs)):

                if i >= len(strs[j]):
                    return base[:i]
                elif base[i] == strs[j][i]:
                    continue
                else:
                    return base[:i]
            i += 1
        return base