求斐波那契数列
def demo(n):
if n == 1 or n==2:
return 1
return demo(n-1)+demo(n-2)
print(demo(3))
求阶层
def demo(n):
if n==0:
return 1
return n*demo(n-1)
print(demo(4))
求斐波那契数列
def demo(n):
if n == 1 or n==2:
return 1
return demo(n-1)+demo(n-2)
print(demo(3))
求阶层
def demo(n):
if n==0:
return 1
return n*demo(n-1)
print(demo(4))