首页 > 编程语言 > 详细

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

时间:2019-06-13 11:35:36      阅读:129      评论:0      收藏:0      [点我收藏+]
  • 算法面试之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]

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

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

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!