238. Product of Array Except Self

1. Description

Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

2. Example

Example 1:
Input: nums = [1,2,3,4]
Output: [24,12,8,6]

Example 2:
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]

3. Constraints

• 2 <= nums.length <= $10^5$
• -30 <= nums[i] <= 30
• The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.

4. Follow Up

• Could you solve it in O(n) time complexity and without using division?
• Could you solve it with O(1) constant space complexity? (The output array does not count as extra space for space complexity analysis.)

5. Solutions

My Accepted Solution(Follow Up)

n = nums.size()
Time complexity: O(n)
Space complexity: O(1)

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

        int left_product = 1;
        for (int i = 0; i < nums.size() - 1; ++i) {
            products[i] = left_product * products[i + 1];
            left_product *= nums[i];
        }
        *products.rbegin() = left_product;

        return products;
    }
};