14. Longest Common Prefix

class Solution:
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        if not strs:
            return ""

        if len(strs) == 1:
            return strs[0]

        #记录第一个string
        temp = strs[0]
        for i in range(1, len(strs)):

            #与之后的每一个string进行比较的size，取较短的那个string的长度进行比较
            j = 0
            sz = min(len(temp), len(strs[i]))
            while j < sz:
                if temp[j] != strs[i][j]:   #如果不相等了就把temp截短，然后break
                    temp = temp[:j]
                    break
                j = j + 1

            #For handle case ['aaa','a'], 就是说比较过的全部相等，但是长度不相等
            temp = temp[:j]

            if temp == "":
                return temp

        return temp