intFib(int n){if(n <=2)return n =0?0:1;returnfib(n -1)+fib(n -2);}
这里的三元运算符不懂得可以去看我前面的三元运算符的博客介绍。
1.2实际代入
#include<stdio.h>intFib(int n){if(n <=2)return n =0?0:1;returnFib(n -1)+Fib(n -2);}intmain(){int n =0;while(scanf("%d",&n)!=EOF){Fib(n);printf("%d",Fib(n));}return0;}
1.3 结果举例
2.迭代法(循环法)
2.1 函数的实现
intFib(int n){int a =1;int b =1;int c =1;for(int i =2; i < n; i++){
c = a + b;
a = b;
b = c;}return c;}
2.2 实际代入
#include<stdio.h>intFib(int n){int a =1;int b =1;int c =1;for(int i =2; i < n; i++){
c = a + b;
a = b;
b = c;}return c;}intmain(){int n =0;while(scanf("%d",&n)!=EOF){Fib(n);printf("%d\n",Fib(n));}return0;}