- 构建乘积数组,给定一个数组A[0,1,2,3,…,N-1],构建一个数组B[0,1,…,n-1],其中b中的元素B[i]=A[0]*A[1]*…*A[i-1]*A[i+1]*…*A[N-1],不能使用除法
解法一:直观地连乘,但是每次都要遍历一次,有重复运算,复杂度O(N^2)
解法二:每次分为两部分,乘完左侧,再乘右侧
void BuildProductionArray(const vector<double>& input, vector<double>& output)
{
if (input.size()<=0 || input.size()!=output.size()) return;
/*
double* C = new double[input.size()]();
double* D = new double[input.size()]();
C[0] = 1;
D[input.size() - 1] = 1;
for (int i = 1; i < input.size(); i++)
C[i] = C[i - 1] * input[i - 1];//空间效率不高,直接整合到ouput里,左到右,
for (int i = input.size() - 2; i >= 0; i--)
D[i] = D[i + 1] * input[i + 1];//空间效率不高,直接整合到ouput里,右到左,
for (int i = 0; i < input.size();i++)
output[i] = C[i] * D[i];
*/
//优化
output[0] = 1;
output[input.size() - 1] = 1;
for (int i = 1; i < input.size(); i++)//left->right
output[i] = output[i - 1] * input[i - 1];
int temp = 1;
for (int i = input.size() - 2; i >= 0; i--)
{
temp *= input[i+1];
output[i] = output[i] * temp;
}
return;
}