14. Longest Common Prefix(暴力循环)

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.

flow

flower

flight

 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