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.)
题意:不能用除法,求一个数组中每个元素除了自己之外,其他数的积.
以nums[i]为分割点,把数组分成2个部分,左右两边,分别求积。
时间复杂度为o(n),没有用额外的数组空间。
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int len=nums.size();
vector<int>v(len,1);
int t=1;
for(int i=1;i<len;i++){
v[i]=v[i-1]*nums[i-1];
}
for(int i=len-2;i>=0;i--){
t*=nums[i+1];
v[i]=v[i]*t;
}
return v;
}
};