ericpuwang

最长公共前缀

https://leetcode.cn/problems/longest-common-prefix/description/

编写一个函数来查找字符串数组中的最长公共前缀。如果不存在公共前缀，则返回""

示例1

输入：strs = ["flower","flow","flight"]
输出："fl"

示例2

输入：strs = ["dog","racecar","car"]
输出：""
解释：输入不存在公共前缀。

提示

• 1 <= strs.length <= 200
• 0 <= strs[i].length <= 200
• strs[i]如果非空，则仅由小写英文字母组成

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        prefix = ""
        for index in range(len(strs[0])):
            for item in strs[1:]:
                if item == prefix:
                    return prefix
                if not item.startswith(prefix+strs[0][index]):
                    return prefix
            prefix += strs[0][index]
        return prefix