题解 | #Fibonacci#简单递归话不多说
Fibonacci
https://www.nowcoder.com/practice/17ad6908e36a49f4b06ea96936e8bb25
#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
using namespace std;
int Fun(int n) {
if (n >= 2) return Fun(n - 1) + Fun(n - 2);
else if (n == 1) return 1;
else return 0;
}
int main() {
int n;
scanf("%d", &n);
printf("%d", Fun(n));
return 0;
}
