斐波拉契队列 1,1,2,3,5,8,…
递归实现 时间复杂度O(2n次方)
int f1(int n)
{
if(n < 1)
return 0;
if(n == 1 || n == 2)
{
return 1;
}
return f1(n-1)+f1(n-1);
}
顺序计算 时间复杂度O(n)
int f2(int n)
{
if(n < 1)
return 0;
if(n == 1 || n == 2)
{
return 1;
}
int res =1;
int pre = 1;
int tmp = 0;
for(int i = 3; i <= n; i++)
{
tmp = res;
res = res + pre;
pre = tmp;
}
return res;
}
矩阵乘法求解 时间复杂度 O(logN)
推理过程:F(N) = F(N-1)+F(N-2) (F(N) , F(N-1))=(F(N-1),F(N-2))*
(a,b)(c,d); F(1) = 1, F(2)=1, F(3) = 2, F(4) = 3 (F(3) ,
F(2))=(F(2),F(1))* (a,b)(c,d); 2,1 = (1,1)* (a,b)(c,d);
a+c=2 b+d = 1
所以矩阵是(1,1)(1,0)
(F(3) , F(2))=(F(2),F(1))(a,b)(c,d)=(1,1)(1,1)(1,0)
(F(4) , F(3))=(F(3),F(2))(a,b)(c,d)=(1,1)(1,1)(1,0)平方
(F(n) , F(n-1)= F(n-1)* F(n-2)(a,b)(c,d)= (1,1)(1,1)(1,0)n-2次方
vector<vector<int>> muliMatrix(vector<vector<int>>&m1, vector<vector<int>>&m2)
{
vector<vector<int>> res (m1.size(), vector<int>(m2[0].size(), 0));
for (int i = 0; i < res.size(); i++)
{
for (int j = 0; j < res[0].size(); j++)
{
for (int k = 0; k < m2.size(); k++)
{
res[i][j] += m1[i][k] * m2[k][j];
}
}
}
return res;
}
vector<vector<int>> matrixPoew(vector<vector<int>>&m, int power)
{
vector<vector<int>> res(m.size(), vector<int>(m[0].size(), 0));
for (int i = 0; i < res.size(); i++)
{
res[i][i] = 1;
}
vector<vector<int>> tmp = m;
for (; power != 0; power >>= 1)
{
if (power & 1)
{
res = muliMatrix(res, tmp);
}
tmp = muliMatrix(tmp, tmp);
}
return res;
}
int f3(int n)
{
if (n < 1)
return 0;
if (n == 1 || n == 2)
{
return 1;
}
vector<vector<int>> base = { { 1, 1 }, { 1, 0 } };
vector<vector<int>> res = matrixPoew(base, n - 2);
return res[0][0] + res[1][0];
}