递归实现和优化后的斐波那契数列
- public static int getFibonacci_0(int n){
- if(n <= 0)
- return 0;
- else if(n == 1)
- return 1;
- else
- return getFibonacci_0(n - 1) + getFibonacci_0(n - 2);
- }
- public static int getFibonacci_1(int n){
- int result[] = {1 , 2};
- if(n < 2){
- return result[n];
- }
- int fibOne = 1;
- int fibTwo = 0;
- int fibN = 0;
- for(int i = 2 ; i <= n ; ++i){
- fibN = fibOne + fibTwo;
- fibTwo = fibOne;
- fibOne = fibN;
- }
- return fibN;
- }
来源: https://www.oschina.net/code/snippet_1051716_58660