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.)
vector<int> productExceptSelf(vector<int>& nums) {
int N = nums.size();
vector<int> res(N,1);
for(int i=0; i<N; i++){
if (i==0) res[i] = 1;
else res[i] = res[i-1]*nums[i-1];
}
int r_prod = 1;
for(int i=N-1; i>=0; i--){
res[i] *= r_prod;
r_prod *= nums[i];
}
return res;
}