def longestCommonPrefix(strs):
if len(strs) == 0:
return ''
if len(strs) == 1:
return strs[0]
s = ''
minlen = float('inf')
for i in strs:
leni = len(i)
minlen = min(minlen, leni)
for i in range(minlen):
count = 1
for j in range(1, len(strs)):
if strs[j - 1][i] == strs[j][i]:
count += 1
else:
if i == 0 and j == 1:
return ''
break
if count == len(strs):
s += strs[j - 1][i]
return s
最长公共前缀
最新推荐文章于 2022-09-30 22:07:37 发布