generator保存的是算法,每次调用next(g),就计算出g的下一个元素的值,直到计算到最后一个元素,没有更多的元素时,抛出StopIteration的错误。
使用for循环,因为generator也是可迭代对象
def fib(max):
n, a, b = 0, 0, 1
while n < max:
yield b
a, b = b, a + b
n = n + 1
return 'done'
generator的函数,在每次调用next()的时候执行,遇到yield语句返回,再次执行时从上次返回的yield语句处继续执行。
杨辉三角(yield)
def showlist(n):
list = [[0 for i in range(n * 2 - 1)]for i in range(n)]
# n-1 为中间值index (n*2-1-1)/2
list[0][n - 1] = 1
list[1][n - 2] = 1
list[1][n] = 1
list[n - 1][2 * (n - 1)] = 1
for r in range(1, n):
for c in range(0, 2 * (n - 1)):
list[r][c] = list[r - 1][c - 1] + list[r - 1][c + 1]
for i in range(0, n):
# 通过index去掉前后多余0
yield(list[i][n - 1 - i:(n - 1) + i + 1])
return 'done'
a = showlist(5)
print(next(a))
print(next(a))
print(next(a))
print(next(a))
print(next(a))
print(next(a))
[1]
[1, 0, 1]
[1, 0, 2, 0, 1]
[1, 0, 3, 0, 3, 0, 1]
[1, 0, 4, 0, 6, 0, 4, 0, 1]
Traceback (most recent call last):
File "/Users/wqh/Desktop/1.py", line 31, in <module>
print(next(a))
StopIteration: done