1.eg:斐波那契数列1,1,2,3,5,8......下一项由前两项相加得到的数列.
用递归来做:(函数自己调用自己);
#include<stdio.h>
int fib(int n) {
if (n == 1 || n == 2) {
return 1;
}
return fib(n - 1) + fib(n - 2);
}
int main() {
int n;
scanf("%d", &n);
fib(n);
printf("%d",fib(n));
}