描述 杨辉三角的定义如下,把每一行看做一个list,试写一个generator,不断输出下一行的list def triangles(max): l = list() for i in range(max): g = list() for j in range(i+1): if j == 0 or j == i: g.append(1) else: g.append(l[j-1] + l[j]) l.clear() for k in range(i+1): l.append(g[k]) yield l return l for n in triangles(10): print(n)