剑指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]。不能使用除法。
import java.util.ArrayList;
public class Solution {
    public int[] multiply(int[] A) {
        if (A.length == 0 || A == null) {
            return null;
        }
        int n = A.length;
        int[] B = new int[A.length];
        //先处理左边
        for (int i = 0, p = 1; i < n; i++) {
            B[i] = p;
            p *= A[i];
        }
        // 在处理右边
        for (int i = n - 1,p = 1; i >= 0; i--) {
            B[i] *= p;
            p *= A[i];
        }
        return B;
    }
}