Python 实现：轻松求解斐波那契数列第 n 项的值

```python def fibonacci(n): if n == 0: return 1 elif n == 1: return 1 else: f_n_minus_1 = 1 f_n_minus_2 = 1 for i in range(2, n+1): f_n = f_n_minus_1 + f_n_minus_2 f_n_minus_2 = f_n_minus_1 f_n_minus_1 = f_n return f_n n = int(input()) result = fibonacci(n) print(result) ``` ######[AI写代码神器 | 251点数解答 | 2024-11-14 16:10:12]