//非递归
int fun(int n)
{
int a = 1 ,b = 1 ,c = 1;
for(int i = 3 ; i<= n ; ++i)
{
c = a + b;
b = a;
a = c;
}
return c;
}
//递归
int fun(int n)
{
if(n <= 2) return 1;
else return
fun(n - 1) + fun(n - 2);
}
契波那切数列
最新推荐文章于 2021-03-21 11:10:36 发布