数组剔除元素后的乘积_LintCode

public class Solution {
    /**
     * @param A: Given an integers array A
     * @return: A Long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]
     */
    public ArrayList productExcludeItself(ArrayList A) {

      ArrayList B = new ArrayList();
        for (int i=0;ireturn B;

    }
     public static  Long add(ArrayList A,int i){
        Long a = Long.valueOf(1);
        for (int j = 0;jfor (int j = i+1;jreturn a;
    }
}