- 给定一个数组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]。不能使用除法。
import java.util.ArrayList;
public class Solution {
public int[] multiply(int[] A) {
int len = A.length;
int [] ordered = new int [len];
int [] reversed = new int [len];
int [] ret = new int [len];
ordered[0] = 1;
reversed[0] = 1;
for(int i = 1; i < len; ++i){
ordered[i] = ordered[i - 1] * A[i - 1];
reversed[i] = reversed[i - 1] * A[len - i];
}
ret[0] = reversed[len - 1];
ret[len - 1] = ordered[len - 1];
for(int i = 1; i < len - 1; ++i){
ret[i] = ordered[i] * reversed[len - i - 1];
}
return ret;
}
}