思路:
1、先判断字符串列表是否为空
2、用第一个字符去匹配后面所有元素,如果不符合,第一个元素做切片匹配,并将切片的结果重新赋值给匹配项,得到结果
class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ if not strs: return '' res = strs[0] for s in strs: if res == s[:len(res)]: continue elif res != s[:len(res)]: tmp = '' i = 0 while i < len(res): if res[:i] == s[:i]: tmp = res[:i] i += 1 res = tmp return res