"""
@param strs: A list of strings
@return: The longest common prefix
"""
def longestCommonPrefix(self, strs):
# write your code here
for element in strs:
if element is None:
return ''
end = 0
minstr = min(len(ele) for ele in strs)
while end < minstr:
for q in range(len(strs)-1):
if strs[q][end] != strs[q-1][end]:
return strs[0][:end-1]
end +=1
return strs[0][end]
******************
不知道哪里错了
********************
倒数第二行end的位置往前应该移动一位
class Solution:
"""
@param strs: A list of strings
@return: The longest common prefix
"""
def longestCommonPrefix(self, strs):
# write your code here
if len(strs) == 0:
return ""
if len(strs) == 1:
return strs[0]
end = 0
minstr = min([len(ele) for ele in strs])
while end < minstr:
for q in range(1,len(strs)):
if strs[q][end] != strs[q - 1][end]:
if end == 1:
return strs[0][0]
return strs[0][:end]
end = end + 1
return strs[0][:end]