编写一个函数来查找字符串数组中的最长公共前缀。
如果不存在公共前缀,返回空字符串 ""
。
示例 1:
输入: ["flower","flow","flight"]
输出: "fl"
示例 2:
输入: ["dog","racecar","car"]
输出: ""
解释: 输入不存在公共前缀。
说明:
所有输入只包含小写字母 a-z
。
class Solution(object):
def longestCommonPrefix(self, strs):
"""
:type strs: List[str]
:rtype: str
"""
res = ""
if len(strs) == 0:
return ""
# zip()函数用于将可迭代对象作为参数,将对象中对应的元素打包成一个个元组,然后返回由这些元组组成的列表
for each in zip(*strs):
# 利用集合创建一个无序不重复元素集
if len(set(each)) == 1:
res += each[0]
else:
return res
return res
if __name__ == '__main__':
s = Solution()
strs = list(map(str,input().split()))
res = s.longestCommonPrefix(strs)
print(res)
收获:
nums = ['flower','flow','flight']
for i in zip(*nums):
print(i)
输出结果:
('f', 'f', 'f')
('l', 'l', 'l')
('o', 'o', 'i')
('w', 'w', 'g')
不用自带函数解法
# -*- coding: utf-8 -*-
class Solution(object):
def longestCommonPrefix(self,strs):
"""
:type strs: List[str]
:rtype: str
"""
if len(strs) == 0:
return ""
res = ""
temp = strs[0]
for s in strs:
if len(temp) > len(s):
temp = s
for i in range(len(temp)):
for j in range(len(strs)):
if strs[j][i] != temp[i]:
return res
res += temp[i]
return res
if __name__ == "__main__":
s = Solution()
strs = list(map(str,input().split()))
print(s.longestCommonPrefix(strs))