题解 | #小乐乐走台阶#
小乐乐走台阶
https://www.nowcoder.com/practice/ebf04de0e02c486099d78b7c3aaec255
#include <stdio.h>
//斐波那契数列问题
int fib(int n) {
if (n <= 2) {
return n;
}
else {
return fib(n-1) + fib(n - 2);
}
}
int main() {
int a=0;
scanf("%d", &a);
int m = fib(a);
printf("%d", m);
return 0;
}
