Leetcode longest common prefix, code running problem

there is a problem with the longest common prefix on leetcode. I want to solve it in a different way, but what I typed is:
fl
fl
flo
Why does print have three results?

class Solution:

def inter_prefix(self,strs=list,minPrefix=str):
    if minPrefix == "": return minPrefix

    for i in range(len(strs)):
        mi = strs[i][:len(minPrefix)]
        if minPrefix != mi:
            minPrefix = minPrefix[:-1]
            self.inter_prefix(strs, minPrefix)
    print(minPrefix)
def longestCommonPrefix(self, strs):
    """
    :type strs: List[str]
    :rtype: str
    """
    if not strs: return ""
    minPrefix = strs[0]
    -sharp if len(strs) == 1:return (minPrefix)
    for i in range(len(strs)):
        if len(minPrefix) > len(strs[i]):
            minPrefix = strs[i]
    self.inter_prefix(strs,minPrefix)

if name ="_ _ main__":

Solution().longestCommonPrefix(["flower","flow","flight"])

Leetcode python

Mar.12,2021

because you use recursion, the function returns print from inside to outside.

to sum up your ideas, you can write like this.

def longest_common_prefix(strs):
    if not strs:
        return ''
    -sharp 
    prefix = min(strs, key=lambda s:len(s))
    while True:
        for i in strs:
            -sharp 
            if not i.startswith(prefix):
                prefix = prefix[:-1]
                break
        -sharp while
        else:
            break
    return prefix

Previous: Linux executes js scripts regularly

Next: Angualr ng-zorro uses instructions to report errors

The fifth question of Python:leetcode is the enumeration method of, Longest Palindromic Substring, center.
1. Doing exercises on leetcode, the fifth question, using the central enumeration method. 2. Refer to this blog post: https: blog.csdn.net asd1369.3. The second method used, other code can understand, I directly posted the question code: x= ...

Leetcode python

Mar.05,2021
Algorithm: similar to N SUM problem solving
topic description similar to the problem of N SUM, the idea comes from a small task encountered in the work, abstracted out: has m items, and gives the unit price of each item, P1 br P2, P3 br. Now there are n orders, and the total amount of each ord...

Algorithm leetcode python

Mar.28,2022