import math def C(a, n): if n == 0 or a == 0 or n == a: return 1 k = math.factorial(n) / (math.factorial(n-a) * math.factorial(a)) return int(k) def triangles(): k = 0 while True: t = [] for i in range(k+1): t.append(C(i,k)) yield t k += 1
杨辉三角的每一行是二次项的系数，直接将每一行的二次项系数直接算出存入列表
Sign in to make a reply
风过杀戮起
import math def C(a, n): if n == 0 or a == 0 or n == a: return 1 k = math.factorial(n) / (math.factorial(n-a) * math.factorial(a)) return int(k) def triangles(): k = 0 while True: t = [] for i in range(k+1): t.append(C(i,k)) yield t k += 1
杨辉三角的每一行是二次项的系数，直接将每一行的二次项系数直接算出存入列表