leetcode刷題二十八

題目叙述

題目解答

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        str0 = strs[0]
        for i in strs:
            l1 = len(str0)
            l2 = len(i)
            l0 = l1 if l1 < l2 else l2
            if l0 == 0:
                return ""
            for j in range(l0):
                if j == l0 - 1:
                    if str0[j] == i[j]:
                        str0 = str0[:l0]
                    else:
                        str0 = str0[:l0 - 1]
                else:
                    if str0[j] != i[j]:
                        str0 = str0[:j]
                        break
        return