杨辉三角

'''
1
1, 1
1, 2, 1
1, 3, 3, 1
1, 4, 6, 4, 1
'''
# def YangHui (num = 10):
#     LL = [[1]]
#     print([1])
#     for i in range(1,num):
#         # LL.append([(0 if j== 0 else LL[i-1][j-1])+ (0 if j ==len(LL[i-1]) else LL[i-1][j]) for j in range(i+1)])
#         print([(0 if j== 0 else LL[i-1][j-1])+ (0 if j ==len(LL[i-1]) else LL[i-1][j]) for j in range(i+1)])
#
# print(YangHui (num = 10))

def fun(n):
    N = [1]
    t = 0
    while t < n:
        yield N
        t = t + 1
        N.append(0)
        N = [N[i-1] + N[i] for i in range(len(N))]

for i in fun(6):
    print(i)
#在每次调用next()的时候执行，遇到yield语句返回，再次执行时从上次返回的yield语句处继续执行。
　　
　　# 循环加每一项 如： 1,2,1,0   1+0,1+2,2+1,0+1