构建乘积数组

给定一个数组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]。不能使用除法。

package multiply;

public class Solution {
	public int[] multiply(int[] A) {
		int n = A.length;
		int[] before = new int[n];
		int[] after = new int[n];
		int[] result = new int[n];

		before[0] = 1;
		for (int i = 1; i <= n - 1; i++) {
			before[i] = before[i - 1] * A[i - 1];
		}

		after[n - 1] = 1;
		for (int i = n - 2; i >= 0; i--) {
			after[i] = after[i + 1] * A[i + 1];
		}

		for (int i = 0; i < n; i++) {
			result[i] = before[i] * after[i];
		}
		return result;
	}
}