238. Product of Array Except Self
Total Accepted:
36710 Total Submissions:
87934 Difficulty: Medium
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.)
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int x = 1, flag = 0;
for (auto i : nums)
{
if (i)
x *= i;
else
++flag;
}
if (!flag)
{
for (auto &i : nums)
i = x / i;
}
else
{
if (flag > 1)
x = 0;
for (auto &i : nums)
{
if (i)
i = 0;
else
i = x;
}
}
return nums;
}
};