#include<stdio.h> int fib(int n){ if(n<=2) { return 1; } else { return fib(n-1) + fib(n-2); } } int main(){ printf("%d\n",fib(30)); return 0; }
//递归 def fib(n): if n==1: return 1 if n==2: return 2 else: return fib(n-1) + fib(n-2) //迭代 def fib(n): if b<2: return 1 a, b =1, 1 for _ in range(3, n): a, b = b, a+b return b
这道题你会答吗?花几分钟告诉大家答案吧!
扫描二维码,关注牛客网
下载牛客APP,随时随地刷题