14.longest-common-prefix

Statement

简体中文English

Metadata

• Link: 最长公共前缀
• Difficulty: Easy
• Tag: 字符串

编写一个函数来查找字符串数组中的最长公共前缀。

如果不存在公共前缀，返回空字符串 ""。

 

示例 1：

输入：strs = ["flower","flow","flight"]
输出："fl"

示例 2：

输入：strs = ["dog","racecar","car"]
输出：""
解释：输入不存在公共前缀。

 

提示：

• 1 <= strs.length <= 200
• 0 <= strs[i].length <= 200
• strs[i] 仅由小写英文字母组成

Metadata

• Link: Longest Common Prefix
• Difficulty: Easy
• Tag: String

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: strs = ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

 

Constraints:

• 1 <= strs.length <= 200
• 0 <= strs[i].length <= 200
• strs[i] consists of only lower-case English letters.

Solution

Python 3

from typing import List


class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        res = 0

        for t in zip(*strs):
            if len(set(t)) == 1:
                res += 1
            else:
                break

        return strs[0][:res]

---

最后更新: October 11, 2023