class Solution(object):
def longestCommonPrefix(self, s):
"""
:type s: str
:rtype: str
"""
if len(s) == 0:
return ''
if len(s) == 1:
return s[0]
max_len = len(s[0])
max_string = s[0]
max_index = 0
for index,item in enumerate(s):
if len(item) > max_len:
max_len = len(item)
max_string = item
max_index = index
i = 0
while i < max_len:
flag = True
for index,item in enumerate(s):
if not item:
flag = False
break
if index == max_index:
continue
if len(item) - 1 < i:
flag = False
break
if item[i] != max_string[i]:
flag = False
break
if not flag:
break
else:
i += 1
if i == 0:
return ''
return max_string[0:i]
Runtime: 84 ms