剑指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]。不能使用除法。
• 地址：牛客地址

问题分析

• 最初想法是利用数组预处理的技巧，创建两个数组，从前向后遍历，得到 fromBegin[i] 记录 A[0] ~ A[i - 1]的乘积结果。从后往前，fromEnd[i] 记录 A[i] ~A[length - 1]的乘积结果。B[i] = fromBegin[i] * fromEnd[i + 1]
• 但其实用B[i] 直接记录结果即可:时间复杂度：O(N),空间复杂度：O(1)

代码实现

import java.util.ArrayList;
public class Solution {
    public int[] multiply(int[] A) {
        int length = A.length;
        int[] B = new int[length];
        if (A == null || length == 0) {
            return B;
        }
        //先让 B[i] == A[0]*A[1]*...A[i-1] 
        B[0] = 1;
        for (int i = 1; i < length ; i++) {
            B[i] = B[i - 1] * A[i - 1];
        }
        //再B[i]的基础上 乘以 A[length-1]* A[length -1]*...A[i+1]
        int temp = 1;
        for (int i = length - 2; i >= 0; i--) {
            temp = temp * A[i + 1];
            B[i] = B[i] * temp;
        }
        return B;
        /*
        int[] fromBegin = new int[length + 1];
        int[] fromEnd = new int[length + 1];
        fromBegin[0] = 1;
        for (int i = 1; i < length + 1; i++) {
            fromBegin[i] = fromBegin[i - 1] * A[i - 1];
        }
        fromEnd[length] = 1;
        for (int i =length - 1; i >= 0; i-- ){
            fromEnd[i] = fromEnd[i + 1] * A[i];
        }
        for (int i = 0; i < length; i++) {
            B[i] = fromBegin[i] * fromEnd[i + 1];
        }
        return B;
        */
    }
}