构建乘积数组

给定一个数组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]。不能使用除法。

记录一个到当前位置的左边的乘积数组和其右边的乘积数组相乘就行

public class Solution {    public int[] multiply(int[] A) {        int n = A.length ;         int[] D = new int[n] ;        int[] C = new int[n] ;         int[] B = new int[n] ;         C[0] = 1 ;         for(int i = 1;i < n;i++){            C[i] = C[i-1]*A[i-1] ;         }        D[n-1] = 1 ;         B[n-1] = C[n-1] ;         for(int i = n-2;i >= 0;i--){            D[i] = D[i+1]*A[i+1] ;             B[i] = C[i]*D[i] ;         }        return B ;     }}