剑指 Offer 66. 构建乘积数组

剑指 Offer 66. 构建乘积数组

难度中等

给定一个数组 A[0,1,…,n-1]，请构建一个数组 B[0,1,…,n-1]，其中 B[i] 的值是数组 A 中除了下标 i 以外的元素的积, 即 B[i]=A[0]×A[1]×…×A[i-1]×A[i+1]×…×A[n-1]。不能使用除法。

示例:

输入: [1,2,3,4,5]

输出: [120,60,40,30,24]

提示：

• 所有元素乘积之和不会溢出 32 位整数

• a.length <= 100000

class Solution {

    public int[] constructArr(int[] a) {

            if (a.length == 0) {

                return new int[0];

            }

            int[] arr = new int[a.length];

            arr[0] = 1;

            for (int i = 1; i < a.length; i++) {

                arr[i] = a[i - 1] * arr[i - 1];

            }

            int temp = 1;

            for (int i = a.length - 2; i >= 0; i--) {

                temp *= a[i + 1];

                arr[i] *= temp;

            }

            return arr;

    }

}

优化更快

class Solution {

    public int[] constructArr(int[] a) {

            int n = a.length;

            int[] B = new int[n];

            for (int i = 0, product = 1; i < n; i++) { /* 从左往右累乘 */

                B[i] = product;

                product *= a[i];

            }

            for (int i = n - 1, product = 1; i >= 0; i--) {/* 从右往左累乘 */

                B[i] *= product;

                product *= a[i];

            }

            return B;

    }

}