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
.
class Solution(object): def longestCommonPrefix_1(self, strs): """ :type strs: List[str] :rtype: str """ if not strs: return '' for i in range(len(strs[0])): for string in strs[1:]: if i >= len(string) or string[i] != strs[0][i]: return string[:i] return strs[0] def longestCommonPrefix_2(self, strs): result = '' i = 0 while True: try: sets = set(string[i] for string in strs) if len(sets) == 1: result += sets.pop() i += 1 else: break except Exception as e: break return result