给定一个数组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]。不能使用除法。(注意:规定B[0] = A[1] * A[2] * ... * A[n-1],B[n-1] = A[0] * A[1] * ... * A[n-2];)
Bn\A | 1 | 2 | 3 | 4 | 5 |
---|---|---|---|---|---|
B0 | 1 | 2 | 3 | 4 | 5 |
B1 | 1 | 1 | 3 | 4 | 5 |
B2 | 1 | 2 | 1 | 4 | 5 |
B3 | 1 | 2 | 3 | 1 | 5 |
B4 | 1 | 2 | 3 | 4 | 1 |
方法一:
import java.util.ArrayList;
public class Solution {
public int[] multiply(int[] A) {
int length = A.length;
int[] B = new int[length];
if(length != 0 ){
B[0] = 1;
//计算下三角连乘
for(int i = 1; i < length; i++){
B[i] = B[i-1] * A[i-1];
}
int temp = 1;
//计算上三角
for(int j = length-2; j >= 0; j--){
temp *= A[j+1];
B[j] *= temp;
}
}
return B;
}
}
方法二:(C++)
class Solution {
public:
vector<int> multiply(const vector<int>& A) {
if(A.empty()) return vector<int>();
int n = A.size();
vector<int> B(n);
//i 左边
for(int i = 0,p = 1;i < n;i++){
B[i] = p;
p *= A[i];
}
//i 右边
for(int i= n-1,p = 1;i >= 0;i--){
B[i] *= p;
p *= A[i];
}
return B;
}
};