Quesiton:
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.)
已知给定数组大小大于1,返回同样大小的数组,返回数组中每个位置的值等于原数组中除了当前元素外所有元素的乘积。要求复杂度为O(n)。
可以先循环判断整个数组中有几个0和除了0以外的元素乘积mul,
如果有2个及以上个0,则返回数组每个元素都为0;
如果只有一个0,则返回数组除了当前元素为0的位置不为0外,其他位置均为0;
如果没有0,则返回数组每个位置的值为mul/nums[i]。
代码如下:
<span style="font-size:14px;">class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
vector<int> result(nums.size());
int mul = 1;
int zeroNum = 0;
for(int i = 0; i < nums.size(); ++i){
if(nums[i] != 0)
mul *= nums[i];
else
++zeroNum;
}
if(zeroNum == 1){
for(int i = 0; i < nums.size(); ++i){
if(nums[i] == 0)
result[i] = mul;
else
result[i] = 0;
}
}
if(zeroNum == 0){
for(int i = 0; i < nums.size(); ++i){
result[i] = mul/nums[i];
}
}
if(zeroNum >= 2){
for(int i = 0; i < nums.size(); ++i){
result[i] = 0;
}
}
return result;
}
};</span>