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.)
分析:
如果数组都是非0的数,用所有非0元素的乘积除以当前元素就是剩余元素之和。
如果当前数组有1个0元素,而且是当前这个元素,结果就是所有非0元素的乘积。
如果不是当前元素说明其余元素中有0,结果就为0。
显然0元素有一个以上,为0。
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
vector<int>v(nums.size());
int sum=1,cnt0=0;
for(int i=0;i<nums.size();i++){
if(nums[i]) sum*=nums[i];
else {v[i]=-1;cnt0++;}//记录0的个数,将nums[i]=0的数组标记
}
for(int i=0;i<nums.size();i++){
if(cnt0==0) v[i]=sum/nums[i];
else if(cnt0==1&&v[i]==-1) v[i]=sum;
else if(cnt0==1&&v[i]!=-1) v[i]=0;
else if(cnt0>1) v[i]=0;
}
return v;
}
};