leetcode238.除自身以外数组的乘积（中等）

思路：前缀乘 后缀乘
= nums[i]左边的乘积✖nums[i]右边的乘积。
具体： 用两个数组来分别存储每个元素左边的乘积和右边的乘积。

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
    
        int n = nums.size();
        vector<int> before(n), after(n);
        before[0] = 1;
        for (int i = 1; i < n; ++i) {
            before[i] = before[i - 1] * nums[i - 1];
        }
        after[n - 1] = 1;
        for (int i = n - 2; i >= 0; --i) {
            after[i] = after[i + 1] * nums[i + 1];
        }
        for (int i = 0; i < n; ++i) {
            before[i] = before[i] * after[i];
        }
        return before;
    }
};

进阶：怎么把空间复杂度缩减到O(1)
提示：
题目中说：输出数组不被视为额外空间
思路：
跟之前思路不变，只是构造ans的时候从后往前遍历

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
      
        int n = nums.size();
        vector<int> ans(n);
        ans[0] = 1;
        for (int i = 1; i < n; ++i) {
            ans[i] = ans[i - 1] * nums[i - 1];
        }
        int after = 1;
        for (int i = n - 1; i >= 0; --i) {
            ans[i] = ans[i] * after;
            after *= nums[i];
        }
        return ans;
    }
};