返回公共前缀abc，[“abca“,“abc9“,“abcf“,“abc8“,“abcc“]

返回公共前缀abc，[“abca”,“abc9”,“abcf”,“abc8”,“abcc”]

#返回公共前缀abc，["abca","abc9","abcf","abc8","abcc"]
def longestCommonPrefix(strs):
    if not strs:
        return ""
    # 以第一个字符串为初始前缀
    prefix = strs[0]
    for s in strs[1:]:
        # 逐个字符比较，缩短前缀直到匹配当前字符串的前缀
        while not s.startswith(prefix):
            prefix = prefix[:-1]
            print('prefix:',prefix)
            # 若前缀为空，直接返回
            if not prefix:
                return ""
    return prefix

# 测试用例
strs = ["abca","abc9","abcf","abc8","abcc"]
print(longestCommonPrefix(strs))  # 输出："abc"

prefix[:-1] 切片，比如list[1,6]一般不包含最后一个元素