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

来源:互联网 发布:殊知的意思是什么 编辑:程序博客网 时间:2024/06/08 05:41

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
0 0
原创粉丝点击