题目:
给定一个数组A[0,1,...,n-1],请构建一个数组B[0,1,...,n-1],其中B中的元素B[i]=A[0]*A[1]*...*A[i-1]*A[i+1]*...*A[n-1]。不能使用除法。
思路:
令C[i]=A[0]*A[1]*...*A[i-1,D[i]=A[i+1]*...*A[n-1]
则有B[i]=C[i]*D[i]
又C[i+1]=C[i]+A[i],D[i]=D[i+1]*A[i+1]
时间复杂度:O(n)
空间复杂度:O(1)
#include <iostream>
#include <vector>
using namespace std;
void ArrMul(int *A, int size,vector<int> &B)
{
vector<int> C(size);
vector<int> D(size);
C[0] = 1;
D[size - 1] = 1;
for (int i = 1; i < size; i++)
{
C[i] = C[i - 1] * A[i - 1];
D[size - i - 1] = D[size - i] * A[size - i];
}
for (int i = 0; i < size; i++) B[i] = C[i] * D[i];
}
int main()
{
int arr[] = { 1, 2, 3 };
vector<int> re(3);
ArrMul(arr, 3, re);
for (int i = 0; i < re.size(); i++)
cout << re[i] << " ";
cout << endl;
return 0;
}