def tri(): L = [1] while True: yield L L.append(0) L = [L[i - 1] + L[i] for i in range(len(L))]
需要注意的是, 杨辉三角第n行就有n个数, 且第n行中第i个数等于第n-1行中第i个数和第i-1个数之和.
Sign in to make a reply
大阳御制
def tri(): L = [1] while True: yield L L.append(0) L = [L[i - 1] + L[i] for i in range(len(L))]
需要注意的是, 杨辉三角第n行就有n个数, 且第n行中第i个数等于第n-1行中第i个数和第i-1个数之和.