利用python的生成器，实现杨辉三角

新手做的练习，代码可能不能看-_-

def yanghui(num):
    n=0
    L1=[1]
    while n<num:
        yield L1
        L2 = []
        for j in range(1,len(L1)):
            k=L1[j-1]+L1[j]
            L2.append(k)
        L2.insert(0, 1)
        L2.append(1)
        L1 = L2
        n = n + 1
    return 'Done'

for n in yanghui(11):
    print(n)

[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]
[1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1]