【LeetCode】14. Longest Common Prefix 解题报告（Python）

原创于 2019-10-14 21:25:39 发布 · 189 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#Leetcode

Leetcode 专栏收录该内容

9 篇文章

订阅专栏

本文提供两种解决LeetCode 14题——寻找字符串数组中最长公共前缀的方法。解法一采用排序并比较首尾字符串的方式，解法二则通过遍历最短字符串进行暴力匹配。

【LeetCode】14. Longest Common Prefix 解题报告（Python）

题目描述
解法1：排序，比较首位字符串
解法2：暴力求解，按照长度最小的字符串遍历

题目地址：https://leetcode.com/problems/longest-common-prefix/

题目描述

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.

解法1：排序，比较首位字符串

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if not strs:
            return ""
        strs.sort()
        size = min(len(strs[0]), len(strs[-1]))
        i = 0
        while i < size and strs[0][i] == strs[-1][i]:
            i += 1
        return strs[0][:i]

解法2：暴力求解，按照长度最小的字符串遍历

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        if not strs or not min([len(str) for str in strs]):
            return ""
        for i in range(min([len(str) for str in strs])):
            pre = strs[0][i]
            if not all(str[i] == pre for str in strs):
                i -= 1
                break
        return strs[0][:i+1]

min用法补充

pre = min(strs, key = len) # 求最小长度字符串