编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 ""
。
示例 1:
输入: ["flower","flow","flight"]
输出: "fl"
示例 2:
输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。
说明:
所有输入只包含小写字母 a-z
。
代码:
class Solution:
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
if len(strs) == 0 or len(strs) is None:
return ""
counter = 0
min_len = pow(2, 31) - 1
flag = False
for str in strs:
temp = len(str)
if temp < min_len:
min_len = temp
while counter < min_len:
temp_str = strs[0][counter]
for str in strs:
if str[counter] is temp_str:
flag = True
else:
flag = False
break
if flag is True:
counter += 1
else:
break
return strs[0][0:counter]