实现最长公共前缀
作者:
地铁姑娘 | 来源:发表于
2018-09-14 16:23 被阅读0次
示例1：
输入['flower','flow','flight']
输出“fl”
示例2：
输入['flower','dog','car']
输出'' ''
class Solution(object):
def longestCommonPrefix(self,strs):
'''
:param strs: List[str]
:return: str
'''
if not strs:
return ''
s1 = min(strs)
s2 = max(strs)
for i,c in enumerate(s1):
if c!= s2[i]:
return s1[:i]
if __name__ == "__main__":
s = Solution()
print s.longestCommonPrefix(['flower','dog','car'])
print s.longestCommonPrefix(['flower','flow','flight'])
结果
image.png
本文标题：实现最长公共前缀
本文链接：https://www.haomeiwen.com/subject/kvwogftx.html
网友评论