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