题目描述:
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.)
给定一个数组,不用额外空间,对每个数求出所有数字的积(除了它本身)。
可令output[i]等于前i-1个数之积,之后对数组从后往前遍历,用变量product储存i+1~n个数的积,那么output[i]*=product。
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
vector<int> output(nums.size(),1);
output[0]=1;
for(int i=1;i<output.size();i++)
output[i]=output[i-1]*nums[i-1];
int product=1;
for(int i=nums.size()-2;i>=0;i--)
{
product*=nums[i+1];
output[i]*=product;
}
return output;
}
};