14.最长公共前缀
编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 “”。
示例 1:
输入:strs = [“flower”,“flow”,“flight”]
输出:“fl”
示例 2:
输入:strs = [“dog”,“racecar”,“car”]
输出:“”
解释:输入不存在公共前缀。
来源:力扣(LeetCode)
链接:https://leetcode.cn/problems/longest-common-prefix
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
re = ''
for ind, str in enumerate(strs):
if ind == 0:
re = str
else:
if len(re) == 0:
return re
i = 0
temp = ''
while(len(re)>i and len(str)>i and re[i]==str[i]):
temp += re[i]
i += 1
re = temp
return re