[开发工具]Python(作业6)

"""
3.定义一个递归函数：打印斐波那契数列
  F[n]=F[n-1]+F[n-2](n>=2,F[0]=0,F[1]=1)

"""

def fibonacci_func(n):
    if n == 1:
        return 0
    if n == 2:
        return 1
    if n > 2:
        return fibonacci_func(n - 1) + fibonacci_func(n - 2)
#0, 1, 1, 2, 3, 5, 8
#获取的是一个值，而不是多个值
#0, 1, 1, 2
#0,
#1,
#1
# 0 + 1 = 1
list_data = []
for i in range(1, 10):
    data = fibonacci_func(i)
    list_data.append(data)
print(list_data)
# fib(n - 1) + fib(n - 2)
# -> fib(n - 2) + fib(n - 3)
# -> fib(n - 3) + fib(n - 4)
# 1, 2 => fib(1) = 0 , fib(2) = 1
# fib(3) = fib(2) + fib(1) = 1
# fib(4) = fib(3) + fib(2) = 2
# fib(5) = fib(4) + fib(3) = 3