LeetCode[238]Product of Array Except Self

238. Product of Array Except Self My Submissions QuestionEditorial Solution

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)时间复杂度和O(1)的空间复杂度（用于储存结果的vector不算在内），参考了Sharing my C++ solution in O(n) and with constant space complexity.这篇心得，没有看具体实现，扫了一眼发现大概思路是双向遍历，最后如下代码AC（貌似相似度有点高啊= =, 估计编译后就百分百的相似度了…）

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

        return res;
    }
};