LeetCode 238. Product of Array Except Self

题目链接
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:

Input: [1,2,3,4]
Output: [24,12,8,6]
Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

思路一

假设[x0,x1,x2,x3,,,,,xn],假设结果数组中某个位置为i, 那么该位置的数据就应该为x0 * x1* …xi-1, xi+1,xn;
得到 xi左边的连乘，并且得到xi右边的连乘，使用两个数组遍历，两趟即可
简单得说
output[i] = { i 前面的数的乘积} X { i 后面的数的乘积}
##代码

 public static int [] solution_2(int []nums){
      if(nums.length == 0 ||nums.length == 1) return nums;
        int n = nums.length;
        //空间负责为0(1),
        int [] left = new int [n];
        left[0] = 1;
        for(int i=1;i<n;++i){
            left[i] = left[i-1] * nums[i-1];
        }
        int right =1;
        for(int i=n-1;i>=0;--i){
            left[i] *= right;
            right *= nums[i];
        }
        return left;

分析

空间复杂度为o(n),时间复杂度为0(n)

思路二

空间复杂度为o(n)
类似于[a1,a2,a3,a4]

1. 先得到res = [1, a1, a1 * a2, a1 * a2 * a3]
2. 最终的结果是final_res = [a2 * a3 * a4, a1*a3*a4, a1*a2* a4, a1* a2 * a3]
3. 对比1和2的结果可以知道，要想由res得到final_res
4. res * [a4*a3*a2, a4*a3, a4, 1]
   通过一个数据逐步得到 [a4*a3*a2, a4*a3,a4,1]

代码

public static int [] solution_2(int []nums){
        if(nums.length == 0 ||nums.length == 1) return nums;
        int n = nums.length;
        //空间负责为0(1),
        int [] left = new int [n];
        left[0] = 1;
        for(int i=1;i<n;++i){
            left[i] = left[i-1] * nums[i-1];
        }
        int right =1;
        for(int i=n-1;i>=0;--i){
            left[i] *= right;
            right *= nums[i];
        }
        return left;

    }