题解 | #最长公共前缀#

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if not strs:
            return ""
        res = ""
        min_len = min([len(s) for s in strs])
        for i in range(min_len):
            char = strs[0][i]
            if all(char == s[i] for s in strs):
                res += char
            else:
                return res
        return res