Python 杨辉三角

def yang():
    list = [1]
    result = []
    print(list)
    left = 0
    right = 0
    while True:
        for i in range(len(list)+1):
            if i == 0:
                result.append(list[0]+left)
            elif i == len(list):
                #last = list[len(list)-1] + right
                result.append(1)
            else:
                result.append(list[i-1] + list[i])
        list = result
        result = []
        yield list
        if len(list)>20:
            break
a = yang()
for j in a:
    print(j)