问题描述
编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 “”。
示例 1:
输入: ["flower","flow","flight"]
输出: "fl"
示例 2:
输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/longest-common-prefix
题解
class Solution:
def longestCommonPrefix(self, strs):
if len(strs) == 0:
return ""
else:
rt_list = []
first_list = list(strs[0][0:])
for i, val in enumerate(first_list):
flag = True
for str_item in strs[1:]:
if len(str_item) < (i+1):
flag = False
break
else:
if str_item[i] != val:
flag = False
break
if flag:
rt_list.append(val)
else:
break
return ''.join(rt_list)
if __name__ == '__main__':
s = Solution()
r = s.longestCommonPrefix(['asxx', 'asdd', 'asdd'])
print(r)