题目很简单,解法也很简单,找到一个然后跟其他挨个比对:
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
if len(strs) == 0:
return ''
s = strs[0]
n = len(strs[0])
N = len(strs)
res = ''
for i in range(1,n+1):
for j in range(1,N):
if i > len(strs[j]):
return res
if s[0:i] != strs[j][0:i]:
return res
res = s[0:i]
return res