最长公共前缀
编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 ""
。
示例 1:
输入:strs = ["flower","flow","flight"] 输出:"fl"
示例 2:
输入:strs = ["dog","racecar","car"] 输出:"" 解释:输入不存在公共前缀。
提示:
0 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i]
仅由小写英文字母组成
class Solution:
def longestCommonPrefix(self, strs: List[str]) -> str:
def twoCommonPrefix(strs1: str,strs2: str):
le1 =len(strs1)
le2 = len(strs2)
le = min(le1,le2)
flag = 0
i = 0
for i in range(le):
if strs1[i] != strs2[i]:
flag = 1
break
return strs1[0:i] if flag == 1 else strs1[0:le]
n = len(strs)
if n == 0:
return ""
elif n==1:
return strs[0]
re = twoCommonPrefix(strs[0],strs[1])
if re =='':
return ""
for i in range(2,n):
re = twoCommonPrefix(strs[i],re)
return re