class Solution:
def longestCommonPrefix(self, strs) -> str:
data = len(strs[0])
if len(strs) == 1:
return strs[0]
else:
common = strs[0]
for x in strs[1:]:
length = min(len(x), len(common))
if length <data:
data = length
for i in range(0, length):
if len(common) < 1:
print("输入不存在公共前缀")
return False
else:
if x[i] != common[i] and data > i:
data = i
return common[0:data]