給定一個數組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==null || A.length == 0){
            return null;
        }
        
        int[] B = new int[A.length];
        int temp = 0;
        for (int i = 0; i < A.length; i++) {
            int res = 1;
            for (int j = 0; j < A.length; j++) {
                if( i == j){
                    temp = A[j];//臨時變量存儲A[j]的值，避免數組值的改變
                    A[j] = 1;
                    res *= A[j];
                    A[j] = temp;
                }else {
                    res *= A[j];
                }
            }
             B[i] = res;
        }
        return B;
    }
}