python_实现_斐波那契额函数

1 def fib(n):
2     if n >= 3:
3         return fib(n-1)+fib(n-2)
4     else:
5         return 1
6 print(fib(6))

 1 while True:
 2     def fib(n):
 3         result = [1,1]
 4         for i in range(n-2):
 5             result.append(result[-2]+result[-1])
 6         return result[-1]
 7 
 8 
 9     n = input(‘你想知道第多少个斐波那契数:‘)
10     if n == ‘q‘:
11         break
12     else:
13         n = int(n)
14         print(‘result = %d‘%(fib(n)))