Discuss / Python / 递归解

递归解

Topic source

#!/usr/bin/python

def transfer(L):

    a = L[:]

    b = L[:]

    a.insert(0,0)

    b.append(0)

    c = [a[i]+b[i] for i in range(len(a))]

    d = c[1:len(c)-1]

    return d

def yangtri(n):

if n == 1:

return [1]

else:

return transfer([0]+yangtri(n-1)+[0])

print(yangtri(800))


  • 1

Reply