Product of Array Exclude Itself

 

Given an integers array A.

Define B[i] = A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1], calculate B WITHOUT divide operation.

 

Example

For A = [1, 2, 3], return [6, 3, 2].

 

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) {        // write your code        ArrayList
         
           list=new ArrayList
          
           ();        if(A.size()==0) return list;        int n=A.size();        if(n==1)         {            long count=1;            list.add(count);                    }                else{        for(int i=0;i