用递归实现阶乘
def func(n):
if n == 1:
return 1
else:
return n * func(n-1)
用递归实现斐波那契数列
def fibo(n):
if n == 1 or n == 2:
def func(n):
if n == 1:
return 1
else:
return n * func(n-1)
def fibo(n):
if n == 1 or n == 2: