函数3——高级话题

递归函数

直接或间接地调用本身以进行重复的函数

L = [1,[2,3,[4,5,6,[7,8,9,10]]]]
def sumtree(L):
    t = 0
    for i in L:
        if not isinstance(i,list):
            t += i
        else:
            t += sumtree(i)
    return t
sumtree(L)L = [1,[2,3,[4,5,6,[7,8,