【Leetcode】14. Longest Common Prefix

Bowen author wangzirui32
Like can give the thumbs-up Collection Pay attention to ~~
This article was first published in CSDN, Reprint is prohibited without permission

1. Title Description

source ： Power button （LeetCode）
link ：https://leetcode.cn/problems/longest-common-prefix/
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

2. Their thinking

We find the minimum length string in the list , Cycle through , Then every time we loop to check whether it is the same as other string prefixes , If the same result is saved result in , The maximum prefix is returned after the loop ends .

3. Code implementation

Code：

class Solution:
    def longestCommonPrefix(self, strs) -> str:
        min_length_str = min(strs, key=lambda s: len(s))
        result = ""
        for i in range(1, len(min_length_str)+1):
            swith = min_length_str[:i]
            if all([k.startswith(swith) for k in strs]):
                result = swith
        return result

Let me parse the important code ：

1. min(strs, key=lambda s: len(s)) Refer to the length of the string , Select the smallest string
2. swith = min_length_str[:i] Get index i Before the prefix
3. all([k.startswith(swith) for k in strs]) Check whether other string prefixes are the same .

4. final result

---

Okay , That's all for today's lesson , I am a wangzirui32, You can collect and pay attention to what you like , See you next time ！