斐波那契数列
要求:写一个函数,输入n,求斐波那契(Fibonacci)数列的第n项。斐波那契数列定义如下:
f ( n ) = { 0 n=0 1 n=1 f ( n − 2 ) + f ( n − 1 ) n>1 f(n)= \begin{cases} \>\>\>\>\>\>\>\>\>\>\>\>\>\>\text{0}\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\text{n=0}\\ \>\>\>\>\>\>\>\>\>\>\>\>\>\>\text{1}\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\>\text{n=1}\\ f(n-2)+f(n-1)\>\>\>\text{n>1}\\ \end{cases} f(n)=⎩⎪⎨⎪⎧0n=01n=1f(n−2)+f(n−1)n>1
解法1:递归实现,时间复杂度O(2^n)
long long Fibonacci(int n)
{
if(n == 0)
return 0;
if(n ==1)
return 1;
return Fibonacci(n-2)+Fibonacci(n-1);
}
解法2:时间复杂度O(n)
long long Fibonacci(int n)
{
int result[2] = {0,1};
if(n<2)
return result[n];
int FibN = 0;
int FibNMinus1 = 1;
int FibNMinus2 = 0;
for(int i=2; i<=n; i++)
{
FibN = FibNMinus1+FibNMinus2;
FibNMinus2 = FibNMinus1;
FibNMinus1 = FibN;
}
return FibN;
}
应用:
斐波那契数列的常见应用:一只青蛙一次可以跳上一级台阶,也可以一次跳上二级台阶。求该青蛙跳上一个N级的台阶总共有多少种跳法。
完整代码:
#include <iostream>
using namespace std;
long long Fibonacci(int n)
{
if(n == 0)
return 0;
if(n ==1)
return 1;
return Fibonacci(n-2)+Fibonacci(n-1);
}
long long Fibonacci1(int n)
{
int result[2] = {0,1};
if(n<2)
return result[n];
int FibN = 0;
int FibNMinus1 = 1;
int FibNMinus2 = 0;
for(int i=2; i<=n; i++)
{
FibN = FibNMinus1+FibNMinus2;
FibNMinus2 = FibNMinus1;
FibNMinus1 = FibN;
}
return FibN;
}
int main()
{
long long n = Fibonacci1(10);
std::cout<<"n:"<<n<<std::endl;
long long m = Fibonacci(10);
std::cout<<"m:"<<m<<std::endl;
return 0;
}