leetcode-最长公共前缀

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

如果不存在前缀，返回空字符串

python：

class Solution:
    def longestprefix(self,strs):
        if len(strs)==0:return ''
        for i in range(len(strs[0])):
            val=strs[0][i]
            for j in range(1,len(strs)):
                if i==len(strs[j]) or strs[j][i]!=val:
                    return strs[0][:i-1]
        return strs[0]
    def longestprefix2(self,strs):
        s=''
        for i in zip(*strs):
            if len(set(i))==1:
                s+=i[0]
            else:
                break
        return s 
# x=Solution()
# a=["flower","flow","flight"]
# print(x.longestprefix2(a))