题解 | #小乐乐走台阶#
小乐乐走台阶
https://www.nowcoder.com/practice/ebf04de0e02c486099d78b7c3aaec255
#include<stdio.h>
int fib(int n)
{
if (n == 1)
return 1;
else if (n == 2)
return 2;
else
return fib(n - 1) + fib(n - 2);
}
int main()
{
//输入一个数,n表示几个台阶
int n = 0;
scanf("%d", &n);
//创建一个函数fib,求出几种方法,类似斐波那契数列
int ret = fib(n);
printf("%d\n", ret);
return 0;
}