class Solution:
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if(len(strs)==0):
return ""
elif(len(strs)==1):
return strs[0]
else:
s=sorted(strs,key=lambda x:len(x) )
print(s)
f1=s[0]
re=''
for i,j in enumerate(f1):
l=[]
for k in s[1:]:
l.append(k[i]==j)
if all(l):
re=re+j
else:
break
return re
leetcode简单题14. 最长公共前缀
猜你喜欢
转载自blog.csdn.net/weixin_38278334/article/details/83589795
今日推荐
周排行