leetcode 14. Longest Common Prefix

答案一

class Solution:
    def longestCommonPrefix(self, strs):
        str_len = len(strs)
        s_pre = ''
        j = 0
        while True:
            for i in range(1,str_len):
                if len(strs[i]) < j+1:
                    return s_pre
                if strs[0][j]==strs[i][j]:
                    if i == str_len -1:
                        s_pre  = s_pre + strs[0][j]
                else:
                    return s_pre
            j += 1

答案二

class Solution(object):
    def longestCommonPrefix(self, strs):
        if not strs: return ''
        first = min(strs,key=len)
        for i in range(len(first)):
            for s in strs:
                if s[i] != first[i]:
                    return first[:i] if i > 0 else ''
        return first