給定一個數組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 ;     }}