P74剑指offer面试题10:斐波那契数列
写一个函数,输入n,求斐波那契数列的第n项。
递归解法:
优点:代码简洁
缺点:重复计算太多,代码效率不高
// C语言代码
// 迭代解法
long long Fibonacci_iteration(unsigned n)
{
if (n <= 0)
return 0;
if (n == 1)
return 1;
return Fibonacci_iteration(n - 1) + Fibonacci_iteration(n - 2);
}
循环解法:
优点:自下而上计算,时间复杂度是O(n)
// C语言代码
// 循环解法
long long Fibonacci(unsigned n)
{
int result[2] = { 0,1 };
if (n < 2)
return result[n];
long long fibNMinusOne = 1;
long long fibNMinusTwo = 0;
long long fibN = 0;
for (unsigned int i = 2; i <= n; i++)
{
fibN = fibNMinusOne + fibNMinusTwo;
fibNMinusTwo = fibNMinusOne;
fibNMinusOne = fibN;
}
return fibN;
}
方法1:
class Solution
{
public:
int Fibonacci(int n)
{
if(n == 0)
return 0;
if(n == 1)
return 1;
int f0 = 0;
int f1 = 1;
int fn = 0;
for(int i = 2; i <= n; i++)
{
fn = f0 + f1;
f0 = f1;
f1 = fn;
}
return fn;
}
};
方法2:
class Solution
{
public:
int Fibonacci(int n)
{
vector<int> ans(n+1, 0);
ans[1] = 1;
for(int i = 2; i <= n; i++)
{
ans[i] = ans[i-1] + ans[i-2];
}
return ans[n];
}
};
方法3:
class Solution
{
public:
int Fibonacci(int n)
{
if(n == 0)
return 0;
if(n == 1 || n == 2)
return 1;
return Fibonacci(n - 1) + Fibonacci(n - 2);
}
};
矩阵解法:
把求斐波那契数列转换成求矩阵的乘方,时间复杂度O(logn)但不够实用
#include <cassert>
struct Matrix2By2
{
Matrix2By2
(
long long m00 = 0,
long long m01 = 0,
long long m10 = 0,
long long m11 = 0
)
:m_00(m00), m_01(m01), m_10(m10), m_11(m11)
{
}
long long m_00;
long long m_01;
long long m_10;
long long m_11;
};
Matrix2By2 MatrixMultiply
(
const Matrix2By2& matrix1,
const Matrix2By2& matrix2
)
{
return Matrix2By2(
matrix1.m_00 * matrix2.m_00 + matrix1.m_01 * matrix2.m_10,
matrix1.m_00 * matrix2.m_01 + matrix1.m_01 * matrix2.m_11,
matrix1.m_10 * matrix2.m_00 + matrix1.m_11 * matrix2.m_10,
matrix1.m_10 * matrix2.m_01 + matrix1.m_11 * matrix2.m_11);
}
Matrix2By2 MatrixPower(unsigned int n)
{
assert(n > 0);
Matrix2By2 matrix;
if(n == 1)
{
matrix = Matrix2By2(1, 1, 1, 0);
}
else if(n % 2 == 0)
{
matrix = MatrixPower(n / 2);
matrix = MatrixMultiply(matrix, matrix);
}
else if(n % 2 == 1)
{
matrix = MatrixPower((n - 1) / 2);
matrix = MatrixMultiply(matrix, matrix);
matrix = MatrixMultiply(matrix, Matrix2By2(1, 1, 1, 0));
}
return matrix;
}
long long Fibonacci_Solution3(unsigned int n)
{
int result[2] = {0, 1};
if(n < 2)
return result[n];
Matrix2By2 PowerNMinus2 = MatrixPower(n - 1);
return PowerNMinus2.m_00;
}
拓展:青蛙跳台阶问题
一只青蛙一次可以跳上1级台阶,也可以跳上2级台阶。求该青蛙跳上一个n级的台阶总共有多少种跳法。
// 力扣接口
// 剑指 Offer 10- II. 青蛙跳台阶问题
int numWays(int n)
{
if(n<2)
return 1;
long long fibNMinusOne = 1;
long long fibNMinusTwo = 1;
long long fibN = 0;
for(unsigned int i = 2; i <= n; ++ i)
{
fibN = (fibNMinusOne + fibNMinusTwo) % 1000000007;
fibNMinusTwo = fibNMinusOne;
fibNMinusOne = fibN;
}
return fibN;
}
拓展2:青蛙跳台阶问题
在青蛙跳台阶的问题中,如果把条件改成:一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级,此时该青蛙跳上一个n级的台阶总共有多少种跳法?
牛客网——跳台阶拓展问题
方法1:
class Solution
{
public:
int jumpFloorII(int number)
{
return 1 << (number - 1);
}
};
方法2:
class Solution
{
public:
int jumpFloorII(int number)
{
int ans = 1;
for(int i = 2; i <= number; i++)
{
ans *= 2;
}
return ans;
}
};