完整代码如下:
# 按照ascII值排 # 所以只需要比较最大最小的公共前缀就是整个数组的公共前缀 class Solution(object): def longestCommonPrefix(self, strs): #如果为空,则返回 if not strs: return "" #按照AScll值,此时s1为flight,s2为flower s1 = min(strs) s2 = max(strs) for i in range(len(s1)): if s1[i]!=s2[i]: return s1[:i] return s1 if __name__ == '__main__': sol = Solution() print(sol.longestCommonPrefix(["flower","flow","flight"]))