python生成器实现杨辉三角

def triangle(max):
	N = [1]
	count = 0
	while max > count:
		count = count + 1
		yield N
		N.append(0)
		N = [N[i - 1] + N[i] for i in range(len(N))]

for n in triangle(10):
	print(n)

运行结果：