给定一个数组nums,有n个整数(n>1),返回一个数组output,要求output[i]是除nums[i]外的所有nums元素的乘积。
不能用除法而且时间复杂度要为O(n).
比如,给定nums=[1,2,3,4],返回output=[24,12,8,6].
还有:
你能不能只用常量的空间复杂度?(注:output数组所用的空间不算)
英语原文:
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) {
vector<int> res(nums.size(), 1);
long left_mul=1;
for(int i=0;i<nums.size();i++){
res[i] *= left_mul;
left_mul *= nums[i];
}
left_mul=1;
for(int i=nums.size()-1;i>=0;i--){
res[i] *= left_mul;
left_mul *= nums[i];
}
return res;
}
};