LintCode-数组剔除元素后的乘积

 1 public class Solution {
 2     /**
 3      * @param A: Given an integers array A
 4      * @return: A Long array B and B[i]= A[0] * ... * A[i-1] * A[i+1] * ... * A[n-1]
 5      */
 6     public ArrayList<Long> productExcludeItself(ArrayList<Integer> A) {
 7         ArrayList<Long> B = new ArrayList<Long>();
 8          for(int i=0;i<A.size();i++){
 9              Long sum = (long) 1;
10              for(int j=0;j<A.size();j++){
11                  if(j != i){
12                      sum *= A.get(j);
13                  }
14              }
15              B.add(sum);
16          }
17          return B;
18     }
19 }