python - 如何更改此函数调用和算法以在大小为 n 的列表中找到具有最小值的字符串。没有 min 函数

Question

如何更改此函数调用和算法以在大小为 n 的列表中找到具有最小值的字符串。我也知道内置的 min 函数，我只是想了解其机制。先声明一下我是CS大一的学生，先为我的无知道歉。

def main():


    strOne = 'stack'
    strTwo = 'over'
    strThree = 'flow'
    strFour = 'please'
    strFive = 'help'

    first = alphabetical(strOne, strTwo, strThree, strFour, strFive)

    print(first)

def alphabetical(one, two, three, four, five):
    low = one
    if two < low:
        low = two
    if three < low:
        low = three
    if four < low:
        low = four
    if five < low:
        low = five  
    return low

main()

    ###################################################################      
    # str_list = ['stack', 'over', 'flow', 'please', 'help'] ??       #
    # for i in str_list: ?? perhaps on the right track with this idea.#
    #       first = alphabetical(i) ?? maybe                          #  
    ###################################################################

Answer 1

使用排序 进行了太多比较。要模拟 min 的作用，您应该只对数据进行一次传递，更新目前看到的最佳(最低)值。

>>> def lowest(sequence):
        'Find the lowest value in a sequence in just one-pass'
        best = sequence[0]
        for i in range(1, len(sequence)):
            if sequence[i] < best:
                best = sequence[i]
        return best

>>> lowest(['stack', 'over', 'flow', 'please', 'help'])
'flow'