菜鸟成长日记
这应该是叫滑窗法吧
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
n = len(strs)
strs_lists = []
for item in strs:
strs_lists.append(list(item))
i = 0
res = ""
endFlag = False
# 一些边界条件的判断
if strs_lists==[] or [] in strs_lists:
return ""
elif len(strs_lists)==1:
return strs[0]
# 一列一列的看
while i < min([len(strs[i]) for i in range(len(strs))]):
w = strs_lists[0][i]
for j in range(1, n):
if strs_lists[j][i] != w:
endFlag=True
if endFlag:
break
else:
res += w
i += 1
return res
运行结果: 时间-40 ms;内存-13.9 MB