def triangles():
a = [1]
while True:
yield a
a = a + [0]
a = [a[i-1
Python爬虫特训第二周(杨辉三角的实现)
最新推荐文章于 2022-01-15 23:05:54 发布
def triangles(): a = [1] while True: yield a a = a + [0] a = [a[i-1] + a [i] for i in range(len(a))] if len(a) > 5: breakn = 0results = []for t in triangles(): print(t) results.append(t)
摘要由CSDN通过智能技术生成