def fibonacci_recursive(n):
if n <= 0:
return 0
elif n == 1:
return 1
else:
return fibonacci_recursive(n-1) + fibonacci_recursive(n-2)
# 示例:求解前10个斐波那契数
fib_sequence = [fibonacci_recursive(i) for i in range(10)]
print("前10个斐波那契数(递归法):", fib_sequence)
代码结果