题解 | #斐波那契数列# 优化非递归
斐波那契数列
http://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3
public int Fibonacci(int n) {
int flag1 = 1,flag2 = 1,sum = 0;
if(n<=2){
return 1;
}
for (int i = 3; i <= n; i++){
sum = flag1 + flag2;
flag1 = flag2;
flag2 = sum;
}
return sum;
}
}
查看22道真题和解析