public int GetNum(int x)
{
if (x <= 0)
{
return 0;
}
if (x == 1 || x == 2)
{
return 1;
}
return GetNum(x - 2) + GetNum(x - 1);
}
用递归法计算斐波那契数列的第n项 (1,1,2,3,5,8,13)
猜你喜欢
转载自blog.csdn.net/qq_42485607/article/details/81907438
今日推荐
周排行