leecode-14-最长公共前缀

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀，返回空字符串""。

1
2
3
4
5
6
7
8
9
示例 1:

输入: ["flower","flow","flight"]
输出: "fl"
示例 2:

输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。

说明: 所有输入只包含小写字母 a-z 。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#!/usr/bin/env python
# -*- coding: utf-8 -*-
# author：sarizzm time:2020/12/21 0021
class Solution:
    def longestCommonPrefix(self, strs):
        strls = ''
        for le in zip(*strs):
            if len(set(le)) == 1:
                strls += le[0]
            else:
                return strls
        return strls


print(Solution().longestCommonPrefix(["dog","racecar","car"]))
#
print(Solution().longestCommonPrefix(["flower","flow","flight"]))

print('')