238 - Product of Array Except Self

Problem

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.)

Code

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        vector<int> vec; 
        int size = nums.size(); 
        if (size == 0 || size == 1) {
            return vec;
        }
        int t = 1, a[size], c[size];
        for (int i = 0; i < size; ++i) {
            a[i] = t * nums[i];
            t *= nums[i];
        }
        t = 1;
        for (int i = size - 1; i >= 0; --i) {
            c[i] = t * nums[i];
            t = t * nums[i];
        }
        vec.push_back(c[1]);
        for (int i = 1; i < size - 1; ++i) {
            vec.push_back(a[i - 1] * c[i + 1]);
        }
        vec.push_back(a[size - 2]);
        return vec;
    }
};

Link: https://leetcode.com/problems/product-of-array-except-self/