LeetCode 之 Product of Array Except Self

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

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

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

Subscribe to see which companies asked this question

题意很简单就能理解，唯一需要注意的是O(n)的时间要求和不要用除法。我的方法是用两个数组辅助，一个记录从前到后累乘的结果，一个记录从后到前累乘的结果，最后输出时只需要取当前元素前后两个累乘的乘积就行了，代码如下：

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int length=nums.size();
        vector<int> front(length,1);
        front[0]=nums[0];
        vector<int> back(length,1);
        back[length-1]=nums[length-1];
        for(int i=1;i<length;i++){
            front[i]=nums[i]*front[i-1];
            back[length-i-1]=nums[length-i-1]*back[length-i];
        }
        vector<int> product(length,0);
        for(int i=0;i<length;i++){
            int f=1,b=1;
            i==0?f=1:f=front[i-1];
            i==length-1?b=1:b=back[i+1];
            product[i]=f*b;
        }
        return product;
    }
};

我还没想到空间复杂度为 O(1)的算法，估计是不能用前后两个数组了，只能在结果数组上操作。