[LeetCode] 由 “分形" 所想

#%%
def listsum(numList):
    if len(numList) == 1:
        return numList[0]
    else:
        return numList[0] + listsum(numList[1:])

print(listsum([1,3,5,7,9]))

import turtle

deftree(branchLen,t):
    if branchLen > 5:
        # 出发后做出一系列动作，最后要回到原点
        t.forward(branchLen)

        t.right(20)
        tree(branchLen-15,t)
        t.left(40)
        tree(branchLen-15,t)
        t.right(20)

        t.backward(branchLen)

def main():
    t = turtle.Turtle()
    myWin = turtle.Screen()

    t.left(90)
    t.up()
    t.backward(100)
    t.down()
    t.color("green")

    tree(100,t)
    myWin.exitonclick()

main()