题目链接点此
class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: strs.sort() re = "" for i,j in zip(strs[0],strs[-1]): if i==j: re+=i else: return re return re
通过sort对list进行排序,然后比较第一个和最后一个的公共前缀即可