編寫一個函數來查找字符串數組中的最長公共前綴。
如果不存在公共前綴,返回空字符串 ""
。
示例 1:
輸入: ["flower","flow","flight"] 輸出: "fl"
示例 2:
輸入: ["dog","racecar","car"] 輸出: "" 解釋: 輸入不存在公共前綴。
說明:
所有輸入只包含小寫字母 a-z
。
class Solution: def longestCommonPrefix(self, strs): """ :type strs: List[str] :rtype: str """ if not strs: return '' s1 = min(strs) s2 = max(strs) for i,j in enumerate(s1): if j != s2[i]: return s1[:i] return s1 if __name__ == '__main__': s=Solution() print(s.longestCommonPrefix(["flower","flow","flight"]))