最长公共前缀

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        # flower
        # flow
        # flight
        # 从左到右遍历strs的每一列
        # 然后从上到下遍历这一列的字母
        s0 = strs[0]
        # 外循环遍历行，内循环遍历列
        for j,c in enumerate(s0):
            for s in strs:
                if j == len(s) or s[j] != c:
                    return s0[:j]
        return s0