解析:先要遍历两次数组,分别求出数组元素的左乘积数组和右乘积数组(不包含当前下标元素),最后遍历一次将左右数组对应元素相乘就得到最终要的结果。
#include<vector>
#include<iostream>
using namespace std;
class Solution {
public:
vector<int> productExceptSelf(vector<int>& nums) {
//vector<int> leftMulti, rightMulti(size, 1);
vector<int> leftMulti, rightMulti;
int size = nums.size();
for (int i = 0; i < size; ++i) {
if (i == 0) {
leftMulti.push_back(1);
continue;
}
leftMulti.push_back(leftMulti.back() * nums[i - 1]);
}
for (int i = size - 1; i >= 0; --i) {
if (i == size - 1) {
rightMulti.push_back(1);
continue;
}
rightMulti.push_back(rightMulti.back() * nums[i + 1]);
}
for (int i = 0; i < size; ++i) {
leftMulti[i] = leftMulti[i] * rightMulti[size - 1 - i];
}
return leftMulti;
}
};