**杨辉三角定义如下:**
1
/ \
1 1
/ \ / \
1 2 1
/ \ / \ / \
1 3 3 1
/ \ / \ / \ / \
1 4 6 4 1
/ \ / \ / \ / \ / \
1 5 10 10 5 1
** 把每一行看做一个list,试写一个generator,不断输出下一行的list:**
def triangles():
out = [1]
while True:
yield out
out = [sum(i) for i in zip([0]+out, out+[0])]
n = 0
results = []
for t in triangles():
print(t)
results.append(t)
n = n + 1
if n == 10:
break
** zip() 函数用于将可迭代的对象作为参数,将对象中对应的元素打包成一个个元组,然后返回由这些元组组成的对象。**
** 如果各个迭代器的元素个数不一致,则返回列表长度与最短的对象相同。**
** zip 语法:zip(\[iterable, ...\]),参数说明:iterabl -- 一个或多个迭代器。**
>>> a = [1, 2, 3]
>>> b = [4, 5, 6]
>>> c = [7, 8]
>>> zip1 = zip(a, b) # a, b长度相同
>>> list(zip1) # list() 转换为列表
[(1, 4), (2, 5), (3, 6)]
>>> zip2 = zip(b, c) # b, c长度不同
>>> list(zip2) # list() 转换为列表
[(4, 7), (5, 8)]
>>> [0]+[1, 1] # 两个列表相加
[0, 1, 1]