Given an array nums
of n integers where n > 1, return an array output
such that output[i]
is equal to the product of all the elements of nums
except nums[i]
.
Example:
Input:[1,2,3,4]
Output:[24,12,8,6]
Constraint: It's guaranteed that the product of the elements of any prefix or suffix of the array (including the whole array) fits in a 32 bit integer.
Note: Please solve it without division and in O(n).
Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)
给定一个由n个整数组成的数组,其中n > 1,返回输出一个数组,使得output[i]
等于除nums[i]
之外所有num元素的乘积。
约束: 保证数组的任何前缀或后缀(包括整个数组)的元素乘积都适合32位整数。
注意: 请不使用除法 并且时间复杂度为O(n)
进阶:
您能以恒定的空间复杂度解决它吗? (出于空间复杂度分析的目的,输出数组不算作额外的空间。)
这道题不让我们使用除法,而且时间复杂度为O(n)。我一开始想法是用两个数组,一个装nums[0]到num[i-1]的乘积,一个装nums[i+1]到nums[n-1]的乘积,
然后两者相乘就是结果了。但是后来写的时候发现可以把最后两次乘积和获取结果放一块,能降低空间开销。
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
vector<int> res(nums.size(), 1);
int right = 1;
for(int i = 1; i < nums.size(); i++){
res[i] = nums[i - 1] * res[i - 1];
}
for(int i = nums.size() - 1; i >= 0; i--){
res[i] *= right;
right *= nums[i];
}
return res;
}
};