题目描述
方法:
遍历每个str的字符,更新前缀:
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
i = 0
base = strs[0]
sub = ""
while i<len(base):
for st in strs:
if i >= len(st):
return sub
if st[i] != base[i]:
return sub
sub += st[i]
i += 1
return sub