擅长:python、mysql、java
<p>不是在每次递归调用中都返回列表,而是返回第n个元素并在<code>Trib</code>函数上聚合列表:</p>
<pre><code>def TribRec(n) :
if n == 0:
return 0
elif n == 1:
return 1
elif n == 2:
return 2
else :
return TribRec(n-1) + TribRec(n-2) + TribRec(n-3)
def Trib(n) :
l = []
for i in range(0, n) :
l.append(TribRec(i))
return l
# Driver code
n = 10
Trib(n)
</code></pre>