首页 > 其他 > 详细

14. Longest Common Prefix

时间:2018-07-10 22:00:21      阅读:196      评论:0      收藏:0      [点我收藏+]
Write a function to find the longest common prefix string amongst an array of strings.

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

 

 

 1 class Solution:
 2     def longestCommonPrefix(self, strs):
 3         """
 4         :type strs: List[str]
 5         :rtype: str
 6         """
 7         if strs==[]:
 8             return ""
 9         shortstr = min(strs,key=len)
10         for i,char in enumerate(shortstr):
11             for other in strs:
12                 if other[i]!=char:
13                     return shortstr[:i]
14         return shortstr

 

14. Longest Common Prefix

原文:https://www.cnblogs.com/zle1992/p/9291659.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!