已知斐波那契数列满足:
fib(0) = 0;
fib(1) = 1;
fib(-1) = 1;
fib(-2) = -1;
fib(-5) = 5;
fib(-8) = -21;
给定一个整数n(可以为负),求出fib(n)
按照思维定式,大家都会写出:fib(n) = fib(n-1) + fib(n-2) n >= 2 这样的递推公式;
但是无法求出n为负数的情况,其实只用对fib(n) = fib(n-1) + fib(n-2)进行稍微变换如下:
n+2置换n
fib(n-2) = fib(n) - fib(n-1) ===========>fib(n) = fib(n+2) - fib(n+1) n <= -3
因此,可以写出如下非递归代码:
long long fib(int n)
{
if (n >= 0) {
if (n == 0)
return 0;
if (n == 1)
return 1;
long long p1 = 0;
long long p2 = 1;
long long fibN = 0;
for (int i = 2; i <= n; ++i) {
fibN = p1 + p2;
p1 = p2;
p2 = fibN;
}
return fibN;
}
else {
if (n == -2)
return -1;
if (n == -1)
return 1;
long long p1 = -1;
long long p2 = 1;
long long fibN = 0;
for (int i = n; i <= -3; ++i) {
fibN = p2 - p1;
p2 = p1;
p1 = fibN;
}
return fibN;
}
}