//递归裴波那契数列
int fei(int i)
{
if (i==1 || i==2)
{
return 1;
}
else
{
return fei(i-1) + fei(i-2);
}
}
转载于:https://www.cnblogs.com/flashweb/archive/2012/12/05/2802762.html
//递归裴波那契数列
int fei(int i)
{
if (i==1 || i==2)
{
return 1;
}
else
{
return fei(i-1) + fei(i-2);
}
}
转载于:https://www.cnblogs.com/flashweb/archive/2012/12/05/2802762.html