编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 ""。
示例 1:
输入:strs = ["flower","flow","flight"]
输出:"fl"
示例 2:
输入:strs = ["dog","racecar","car"]
输出:""
解释:输入不存在公共前缀。
提示:
1 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i] 仅由小写英文字母组成
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
index, res, min_len = 0, "", min([len(s) for s in strs]),
for i in range(min_len):
temp = ''
for j in strs:
if temp == '':
temp = j[i]
elif j[i] != temp:
return res
res += temp
return res
评论 (0)