感觉网上有些代码有点复杂，整理了斐波那契数列的递推和递归两种写法。都是输入n之后，答案给出第n个数是几。

递推代码

```python

fib = [0 for i in range(100000)]
n = int(input())
def fibo():fib[0],fib[1] = 1,1for i in range(2,n):fib[i] = fib[i-1] + fib[i-2]print(fib[n-1])
fibo()

 

递归代码

```python

n = int(input())
def fibo(n):if n<=2:return 1else:return(fibo(n-1)+fibo(n-2))
print(fibo(n))