1. 题目

leetcode.cn/problems/lo…

2. 题解

先找出数组中字典序最小和最大的字符串，最长公共前缀即为这两个字符串的公共前缀

3. 核心代码

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if strs is None: return ''
        s1 = min(strs)
        s2 = max(strs)
        for i, x in enumerate(s1):
            if x != s2[i]: return s1[:i]
        return s1