4、Write a function to find the longest common prefix string amongst an array of strings

最新推荐文章于 2024-01-04 11:19:58 发布

王安安

最新推荐文章于 2024-01-04 11:19:58 发布

阅读量569

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： easy

本文链接：https://blog.youkuaiyun.com/m0_37118611/article/details/78367515

leetcode 专栏收录该内容

4 篇文章

订阅专栏

本文介绍了一种用于寻找字符串数组中最长公共前缀的算法实现。通过选取最短字符串作为基准，逐位比较所有字符串来确定公共前缀。适用于需要进行字符串匹配或处理的应用场景。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

class Solution(object):
def longestCommonPrefix(self, strs):
shortest_string = ""
for member in strs:
if (shortest_string == "") or (len(member) < len(shortest_string)):
shortest_string = member
if shortest_string == "":
return ""
common_pre = ""
shortest_string_length = len(shortest_string)
for pre_length in range(1, shortest_string_length + 1) :
common_pre_temp = shortest_string[0:pre_length]
for member in strs:
if common_pre_temp != member[0:pre_length]:
return common_pre
common_pre = common_pre_temp
return common_pre


"""
:type strs: List[str]
:rtype: str
"""