递归函数即函数内部调用函数本身
def rec(n):
n = n-1
if n == 1:
return 1
return n*rec(n-1)
print(rec(10))
# F(0)=0,F(1)=1, F(n)=F(n-1)+F(n-2) 斐波那契数列
def feb(n):
arr = [0, 1, 0, ]
for i in range(2, n):
arr[i] = arr[i-1]+arr[i-2]
arr.append("")
arr.pop()
print(arr)
feb(10)