码迷,mamicode.com
首页 > 其他好文 > 详细

14. Longest Common Prefix

时间:2018-07-10 22:07:33      阅读:153      评论:0      收藏:0      [点我收藏+]

标签:letters   find   desc   HERE   input   letter   comm   write   ring   

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

标签:letters   find   desc   HERE   input   letter   comm   write   ring   

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

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!