算法面试之LeetCode-14-最长公共前缀-Python

• 算法面试之LeetCode-14-最长公共前缀-Python
  • 方法一： 耗时约20ms

  class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if not strs:
            return ""
        min_n = -1
        for m in strs:
            n = len(m)
            if min_n == -1:
                min_n = n
            if n < min_n:
                min_n = n
        if not min_n:
            return ""
        mark = False
        j = 0
        first = strs[0]
        while j < min_n and not mark:
            compare = first[j]
            for num in strs:
                if num[j] != compare:
                    mark = True
                    break
            if not mark:
                j += 1
        if not first[0:j]:
            return ""
        return first[0:j]

原文：https://www.cnblogs.com/max520liuhu/p/11015169.html