1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

class Solution:
    def longestCommonPrefix(self, strs: list[str]) -> str:
        result = ""
        for chars in zip(*strs):
            if len(set(chars)) > 1:
                return result
            result += chars[0]
        return result

    def longestCommonPrefix2(self, strs: list[str]) -> str:
        if not strs:
            return ""
        max_prefix_len = min(map(len, strs))
        for i in range(max_prefix_len):
            char = strs[0][i]
            if any(s[i] != char for s in strs[1:]):
                return strs[0][:i]
        return strs[0][:max_prefix_len]