【LeetCode】14. Longest Common Prefix

先排序再解決，思路和方案還是很直觀的： class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: if len(strs) > 1: ret = sorted(strs) mini = ret[0] max_ = ret

>>阅读原文<<