非递归版本:
public class Solution {
public int Fibonacci(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
int fir=0;
int sec=1;
int count=0;
if(n>1){
for(int i=2;i<=n;i++){
count=fir+sec;
fir=sec;
sec=count;
}
}
return count;
}
}