斐波那契数列f(n)满足:
- f(0) = 0;
- f(1) = 1;
- f(n) = f(n-1) + f(n-2);
要求输入n,输出斐波那契数列第n项的值:
- (1)非递归:
//斐波那契数列的非递归解法
#include <stdio.h>
int main(int argc, char const *argv[]) {
int n;
scanf("%d", &n);
int ans;
if( n
斐波那契数列f(n)满足:
要求输入n,输出斐波那契数列第n项的值:
//斐波那契数列的非递归解法
#include <stdio.h>
int main(int argc, char const *argv[]) {
int n;
scanf("%d", &n);
int ans;
if( n