杨辉三角

# coding:gbk

def triangles():
    L = [1]
    while True:
        yield L
        L.append(0)
        L.insert(0, 0)
        L1 = []
        for i in range(len(L)-1):  #这里可以写成 [L[i]+L[i+1] for i in range(len(L)-1)]
            l = L[i] + L[i+1]
            L1.append(l)
        L = L1
#第二种解法

def triangles():
    L = [1]
    while True:
        yield L
        L.append(0)
        L = [L[i-1] + L[i] for i in range(len(L))
#第三种解法

L=[1]
while 1:
    yield L
    L = [1] + [L[x]+L[x+1] for x in range(len(L)-1)] + [1] #range（0）的返回值可能是None，L=[1]时没有进行for循环