原题链接:Leetcode 238. Product of Array Except Self
Given an integer array nums
, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
You must write an algorithm that runs in O(n) time and without using the division operation.
Example 1:
Input: nums = [1,2,3,4]
Output: [24,12,8,6]
Example 2:
Input: nums = [-1,1,0,-3,3]
Output: [0,0,9,0,0]
Constraints:
- 2 <= nums.length <= 105
- -30 <= nums[i] <= 30
- The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
Follow up:
- Can you solve the problem in O(1) extra space complexity? (The output array does not count as extra space for space complexity analysis.)
方法一:左右乘积数组
思路:
维护两个数组l和r
其中l[i]表示nums[i]左边所有元素的乘积和,r[i]表示nums[i]右边所有元素的乘积和
那么l[0] = r[n-1] = 1,因为他们的外边并没有元素
最后通过左右两个乘积再求乘积 得到答案
C++代码:
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
int n = nums.size();
// 左右乘积列表 l(i)为i左侧所有元素的乘积 r(i)为i右侧所有元素的乘积
vector<int> l(n, 0);
vector<int> r(n, 0);
vector<int> ans(n, 0);
// 维护两个列表 最开头两个值为1
l[0] = r[n-1] = 1;
for(int i = 1; i < n; i++ )
l[i] = l[i - 1] * nums[i - 1];
for(int j = n - 2; j >= 0; j-- )
r[j] = r[j + 1] * nums[j + 1];
for(int i = 0; i < n; i++ )
ans[i] = l[i] * r[i];
return ans;
}
};
复杂度分析:
- 时间复杂度:O(n),两次遍历数组
- 空间复杂度:O(n),两个辅助数组。每个数组的长度为n