剑指offer -- 构建乘积数组

题目描述

给定一个数组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]。不能使用除法。（注意：规定B[0] = A[1] * A[2] * ... * A[n-1]，B[n-1] = A[0] * A[1] * ... * A[n-2];）

解题思路

package array;

import java.util.Arrays;

public class ConstructMultiplyArray {
	public int[] multiply(int[] A) {
		int len = A.length;
		int[] B = new int[len];
		B[0] = 1;
		for (int i = 1;i < len;i++) { //下三角
			B[i] = B[i - 1] * A[i - 1];
		}
		System.out.println(Arrays.toString(B));
		int a = 1;
		for (int j = len - 2;j >= 0;j--) {
			a = a * A[j + 1];  //上三角
			B[j] = B[j] * a;
		}
		return B;
	}
	public static void main(String[] args) {
		int[] A = {2,3,4,5,6};
		System.out.println(Arrays.toString(new ConstructMultiplyArray().multiply(A)));
	}
}