剑指Offer-构建乘积数组

给定一个数组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];）

public class Solution {
        public int[] multiply(int[] A) {
            int[] left = new int[A.length];
            int[] right = new int[A.length];
            left[0] = 1;
            right[0] = 1;
            int[] B = new int[A.length];
            if (A == null) {
                return null;
            }
            for (int i = 1; i < A.length; i++) {
                left[i] = left[i - 1] * A[i - 1];
                right[i] = right[i - 1] * A[A.length - i];
            }
            for (int i = 0; i < A.length; i++) {
                B[i] = left[i] * right[A.length - i - 1];
            }
            return B;
        }
    }