[leetCode By Python] 14. Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        results = ""
        if strs == []:＃若为空集，则输出“”
            return ""
        else:
         strs.sort(key=len) ＃将列表的字符串按按长度进行排序
         xlength = len(strs[0]) ＃求出最短字符串的长度，因为最长公共前缀字符串肯定小于等于最短字符串
         n=0   ＃计数器
         for a in range(xlength):
            resultSM = []
            for i in strs:  ＃将每一个字符串的第n个字符记录进空列表中
                resultSM.append(i[n])
            resultsm = list(set(resultSM))
            if len(resultsm)>1:＃若每一个字符串的第n个字符都相等，则加入最长公共前缀字符串中，否则就直接退出循环
                return results
            else:
                results = results+ resultsm[0]
            n = n+1
         return results