楊輝三角 python

def my_fun(Max):
    n,L = 0,[[1]]
    while n<Max:
        yield (L[n])
        l = [1] + [L[n][x]+L[n][x+1] for x in range(0,len(L[n])-1)] + [1]
        L.append(l)
        n = n + 1
    return "done"

輸出爲

[1]
[1, 1]
[1, 2, 1]
[1, 3, 3, 1]
[1, 4, 6, 4, 1]
[1, 5, 10, 10, 5, 1]
[1, 6, 15, 20, 15, 6, 1]
[1, 7, 21, 35, 35, 21, 7, 1]
[1, 8, 28, 56, 70, 56, 28, 8, 1]
[1, 9, 36, 84, 126, 126, 84, 36, 9, 1]