LeetCode | 238. Product of Array Except Self

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]


Constraint: It's guaranteed that the product of the elements of any prefix or suffix of the array (including the whole array) fits in a 32 bit integer.

Note: Please solve it without division and in O(n).

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

class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int size = nums.size();
vector<int> res(size, 1);
if (size < 1)
return res;

int left = 1;
for (int i = 1; i < nums.size(); i++)
{
res[i] = left * nums[i - 1];
left *= nums[i - 1];
}
int right = 1;
for (int i = size - 2; i >= 0; i--)
{
res[i] *= right * nums[i + 1];
right *= nums[i + 1];
}
return res;
}
};

01-13 259
07-20 1107
04-16 954
03-05 186