标签：print while python实现 python div int 杨辉三角 pre 实现
def yanghui(lines):
currentlst,lastlst,n=[],[],1
if lines<1:
return
while n<=lines:
lastlst=currentlst
currentlst=[]
for i in range(n):
if(i==0):
currentlst.insert(0,1)
elif(i==n-1):
currentlst.insert(i,1)
else:
currentlst.insert(i,lastlst[i]+lastlst[i-1])
n=n+1
yield currentlst
f = yanghui(10)
for t in f:
print(t)
标签：print while python实现 python div int 杨辉三角 pre 实现
原文地址：https://www.cnblogs.com/quota/p/11082545.html
