题解 | #最长公共前缀#

#找出最长和最短的两个字符串比较这俩的前i位是否相同
class Solution:
    def longestCommonPrefix(self , strs: List[str]) -> str:
        # write code here
        if not strs:
            return ""
        s1,s2=min(strs),max(strs)
        for i in range(len(s1)):
            if s1[i]!=s2[i]:
                return s1[:i]
        return s1