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

 class Solution:
     def longestCommonPrefix(self, strs):
         """
         :type strs: List[str]
         :rtype: str
         """
         if strs==[]:
             return ""
         shortstr = min(strs,key=len)
         for i,char in enumerate(shortstr):
             for other in strs:
                 if other[i]!=char:
                     return shortstr[:i]
         return shortstr