python_leetcode14. 最长公共前缀

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀，返回空字符串 ""。

示例 1:

输入: ["flower","flow","flight"]
输出: "fl"

示例 2:

输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。

说明:

所有输入只包含小写字母 a-z 。

(一)

def longestCommonPrefix(strs):
    """
    :type strs: List[str]
    :rtype: str
    """
    if strs == []:
        return ""
    common = []
    flag = 0
    def minimum(s):
        m = list(map(len,s))
        return s[m.index(min(m))]
    temp = minimum(strs)
    if temp == '':
        return ''
    a = temp[0]
    for i in strs:
        if i[0] != a:
            return ''
    for i in range(len(temp)):
        for j in strs:
            if temp[i]!=j[i]:
                flag = 1
                break
        if flag == 0:
            common.append(temp[i])
    return ''.join(common)

 

（二）

class Solution:
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        return os.path.commonprefix(strs)

 

commonprefix源码为，通过枚举法，返回

# Return the longest prefix of all list elements.
def commonprefix(m):
    "Given a list of pathnames, returns the longest common leading component"
    if not m: return ''
    s1 = min(m)
    s2 = max(m)
    for i, c in enumerate(s1):
        if c != s2[i]:
            return s1[:i]
    return s1