生成斐波纳契数列前n项python
时间: 2024-09-10 15:11:07 浏览: 19
在Python中,我们可以使用循环或者递归的方式来生成斐波那契数列的前n项。以下是两种常见的实现方法:
**1. 使用循环(迭代法)**:
```python
def fibonacci_iterative(n):
fib_sequence = [0, 1] # 初始化序列
while len(fib_sequence) < n:
next_number = fib_sequence[-1] + fib_sequence[-2] # 计算下一项
fib_sequence.append(next_number)
return fib_sequence[:n]
# 示例:生成前10项斐波那契数列
n = 10
fibonacci_numbers = fibonacci_iterative(n)
```
**2. 使用递归(递归法,虽然效率较低)**:
```python
def fibonacci_recursive(n, a=0, b=1):
if n <= 0:
return []
elif n == 1:
return [a]
else:
result = fibonacci_recursive(n - 1, b, a + b)
result.insert(0, a)
return result
# 示例:生成前10项斐波那契数列
n = 10
fibonacci_numbers = fibonacci_recursive(n)
```