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]
.
一开始自己想到了用res存储从左到右的乘积,但是没有想到从右到左的时候只用一个数就可以了,以为要用一个数组2333.另一个要注意的点是要记得res[i]存储的是0到i-1的乘积。因此res[0]=1。
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int n = nums.size();
vector<int> res(n, 0);
res[0] = 1;
for(int i = 1; i < n; ++ i){
res[i] = nums[i-1] * res[i-1];
}
int right = 1;
for(int i = n - 1; i >= 0; -- i){
res[i] *= right;
right *= nums[i];
}
return res;
}
};