【Longest Common Prefix】-(Python)

正在沿着IT树往上爬

已于 2022-03-24 17:48:39 修改

阅读量105

点赞数

分类专栏： LeetCode 文章标签： python leetcode

于 2021-12-06 18:36:08 首次发布

本文链接：https://blog.csdn.net/weixin_39400958/article/details/121753010

版权

LeetCode 专栏收录该内容

51 篇文章 0 订阅

订阅专栏

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.

Example 3:

Input: strs = ["a"]
Output: "a"
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.

class Solution(object):
    def longestCommonPrefix(self, strs):
        """
        :type strs: List[str]
        :rtype: str
        """
        prefix = ""
        one = strs[0]
        for i in range(0, len(one)):

            for j in range(0, len(strs)):
                if len(strs[j]) > i:
                    if one[i] != strs[j][i]:
                        return prefix
                    elif j == len(strs) - 1:
                        prefix = prefix + one[i]
                else:
                    return prefix
        return prefix