def triangles(n):
l = []
while n > 0:
l = [l[i-1] + l[i] if i > 0 and i < len(l) else 1 for i in range(len(l) + 1)]
n = n - 1
yield l
好厉害啊！！
def Yanghui(n):
for x in range(n):
l = [ 1 if i == 0 or i == len(l) else (l[i-1] + l[i]) for i in range(len(l) + 1)]
换个循环形式更容易理解一点
Sign in to make a reply
沉默的小白
def triangles(n):
l = []
while n > 0:
l = [l[i-1] + l[i] if i > 0 and i < len(l) else 1 for i in range(len(l) + 1)]
n = n - 1
yield l