leetcode - 14. Longest Common Prefix

最新推荐文章于 2025-03-25 21:56:42 发布

KpLn_HJL

最新推荐文章于 2025-03-25 21:56:42 发布

阅读量192

点赞数

分类专栏： OJ题目记录文章标签： leetcode java 数据结构

本文链接：https://blog.csdn.net/sinat_41679123/article/details/133333772

版权

OJ题目记录专栏收录该内容

576 篇文章

订阅专栏

Description

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 lowercase English letters.

Solution

Simulation

Time complexity: $o (s t r . l e n * l e n (s t rs))$
Space complexity: $o (1)$

Sort

Sort the strings lexicographically, and compare the first and last.

Code

Simulation

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        res = 1
        min_len = min(len(i) for i in strs)
        while res <= min_len:
            cur_prefix = strs[0][:res]
            same_flag = True
            for i in range(1, len(strs)):
                same_flag &= cur_prefix == strs[i][:res]
            if not same_flag:
                break
            res += 1
        return strs[0][:res - 1]

Sort

class Solution:
    def longestCommonPrefix(self, strs: List[str]) -> str:
        strs.sort()
        res = ''
        first, last = strs[0], strs[-1]
        for i in range(len(first)):
            if first[i] == last[i]:
                res += first[i]
            else:
                break
        return res