def PascalsTriangle():
l = [1]
while True:
yield l
length = len(l)
ll = [l[i - 1] + l[i] if i > 0 and i < length else 1 for i in range(0, length + 1)]
l = list(ll)
def PascalsTriangle():
l = [1]
ll = [1]
while True:
yield l
length = len(l)
for p in range(1, length):
ll[p] = l[p - 1] + l[p]
ll.append(1)
l = list(ll)
Terser
精简版:
但是太精简会导致可读性太差,我们来一个可读性强点的版本:
这个版本就可以清楚的看清楚是怎么从上一行得到下一行的。