剑指Offer第七题:斐波那契数列
递归,性能较差
public class Solution {
public int Fibonacci(int n) {
if( n == 0)
return 0;
if( n == 1){
return 1;
}
else{
return Fibonacci( n-1 )+ Fibonacci( n-2 );
}
}
}
循环,性能较好
public class Solution {
public int Fibonacci(int n) {
if(n == 0) {
return 0;
}
if(n == 1) {
return 1;
}
int res = 1;
int first = 0;
int second = 1;
for(int i = 2; i <= n; i++){
res = first + second;
first = second;
second = res;
}
return res;
}
}