第五天-打卡

直接上题目

看到这个题目，想到的还是循环解决，下面看代码：

class Solution(object):
    def longestCommonPrefix(self, strs):
        if len(strs) == 0:
            return ''
        min_len = strs[0]
        for i in range(len(strs)):
            if len(strs[i]) < len(min_len):
                min_len = strs[i]
        equ_str = ''
        for i in range(len(min_len)):
            for j in range(len(strs)):
                if min_len[i] != strs[j][i]:
                    return equ_str
            equ_str = equ_str + min_len[i]
        return equ_str