#杨辉三角
def result(L):
n,a=0,0
T=[]
for x in L:
T.append(int(a)+int(x))
if n==len(L)-1:
T.append(L[-1])
n=n+1
a=x
return T
def getTree(m,s):
while m>0:
m=m-1
s=result(s)
yield s
#把返回的数组,作为参数传到result里面
def getTreeList():
for x in getTree(5,[1]):
print(x)
print(getTreeList())
Sign in to make a reply
只想一夜暴富
#杨辉三角
def result(L):
n,a=0,0
T=[]
for x in L:
T.append(int(a)+int(x))
if n==len(L)-1:
T.append(L[-1])
n=n+1
a=x
return T
def getTree(m,s):
while m>0:
m=m-1
s=result(s)
yield s
#把返回的数组,作为参数传到result里面
def getTreeList():
for x in getTree(5,[1]):
print(x)
print(getTreeList())