斐波那契数列的本源形式:
f(0) = 0; f(1) = 1; f(n) = f(n-1) + f(n-2).
斐波那契数列的代码实现:
(1)循环:
public int Fibonacci(int n) {
int a = 1;
int b = 1;
int c = 0;
if (n < 0) {
return 0;
} else if (n == 1 || n == 2) {
return 1;
} else {
for (int i = 3; i <= n; i++) {
c = a + b;
b = a;
a = c;
}
return c;
}
}
(2)递归: