//数组方式
int fibonacci_array(int n) {
int fib[n+1];
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i <= n; i++) {
fib[i] = fib[i-1] + fib[i-2];
}
return fib[n];
}
int main() {
int n = 20;
int result = fibonacci_array(n);
printf("第%d项斐波那契数列的值为:%d\n", n, result);
return 0;
}
//递归方式
int fibonacci_recursive(int n) {
if (n == 1 || n == 2) {
return 1;
} else {
return fibonacci_recursive(n-1) + fibonacci_recursive(n-2);
}
}
int main() {
int n = 20;
int result = fibonacci_recursive(n);
printf("第%d项斐波那契数列的值为:%d\n", n, result);
return 0;
}