//建议不要用递归,有可能时间更长,或者内存过大
public class Solution {
public int Fibonacci(int n) {
if(n==0||n==1)
return n;
int i=2,temp1=0,temp2=1,fn=0;
while(i<=n){
fn = temp1+temp2;
temp1=temp2;
temp2=fn;
i++;
}
return fn;
}
}