leetcode——14.最长公共前缀

自己的解法

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if len(strs) == 1 or len(strs[0]) == 0:
            return strs[0]
        str_pre = ""
        mark = True
        i = -1
        while mark:
            i = i + 1
            start = strs[0][i]
            for j in range(1, len(strs)):
                if i + 1 > len(strs[j]):
                    mark = False
                    return str_pre
                if strs[j][i] != start:
                    mark = False
                    return str_pre
            str_pre = str_pre + strs[j][i]
            if i + 1 >= len(strs[0]):
                mark = False
                return str_pre