花了快两个小时搞的，和其他人的解法比起来不够简便
Topic source
格式不太好,重新贴一下
def triangles():
n, lx, ly = 1, [], [1]
while True:
yield(ly)
lx = ly[:]
m = n + 1
ly = list(range(m))
for i in range(m):
if i - 1 < 0:
ly[i] = lx[i]
elif i + 1 == m:
ly[i] = lx[i-1]
else:
ly[i] = lx[i] + lx[i-1]
n = n + 1
- 1
用户5393841808
def triangles(): n, lx, ly = 1, [], [1] while True: yield(ly) lx = ly[:] m = n + 1 ly = list(range(m)) for i in range(m): if i - 1 < 0: ly[i] = lx[i] elif i + 1 == m: ly[i] = lx[i-1] else: ly[i] = lx[i] + lx[i-1] n = n + 1