14. Longest Common Prefix (python 3)

14. Longest Common Prefix (python 3)

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.

code

class Solution:def longestCommonPrefix(self, strs):""":type strs: List[str]:rtype: str"""output = ""if len(strs) != 0:min_len = min([len(i) for i in strs])for i in range(min_len):if [s[i] for s in strs] != [strs[0][i] for s in strs]:breakelse:output += strs[0][i]else:output = ""return output

tips:

注意输入为空（即[]）的情况