防止效率过低:
例题:
代码如下:
#include
using namespace std;
long long Fibonacci(unsigned int n)
{
if(n <= 1 )
{
return n;
}
int prv = 0;
int crv = 1;
int fn = 0;
for(int i = 2;i <= n;i++)
{
fn =(i-1)+(i - 2);
}
return fn;
}
int main()
{
Fibonacci(9);
long long fn=Fibonacci(9);
cout<<fn<<endl;
return 0;
}
运行结果截图:
测试用例:
Fibonacci(9);
long long fn=Fibonacci(9);
斐波拉契数列
最新推荐文章于 2024-06-23 09:52:46 发布