unsigned long Fibonacci(unsigned n) {
unsigned i = 1;
unsigned long f_2 = 1;
unsigned long f_1 = 1;
unsigned long f = 0;
if (n > 2) {
for (i = 1; i <= n - 2; i++) {
f = f_1 + f_2;
f_2 = f_1;
f_1 = f;
}
}
else f = 1;
return f;
}
C.Primer 9.11 斐波那契数列 循环
最新推荐文章于 2024-09-26 09:55:13 发布