数据结构-线性表(数组)-前缀和变形-前缀积 238. 除自身以外数组的乘积&&剑指 Offer 66. 构建乘积数组

• 解题思路

1. 与前缀和数组和后缀和数组类似，构建前缀积数组和后缀积数组
2. 利用O(1)的空间复杂度，构建后缀积数组，利用前缀积值
3. 利用前缀积值和后缀积值同时进行

• 代码

1. q前缀积数组和后缀积数组

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int len = nums.size();
        vector<int> left(len,1),right(len,1);
        vector<int> answar(len);

        for(int i = 1;i<len;++i){
            left[i] = left[i-1]*nums[i-1];
        }
        for(int i = len-2;i>=0;--i){
            right[i] = right[i+1]*nums[i+1];
        }
        for(int i = 0;i<len;++i){
            answar[i] = left[i] * right[i];
        }
        return answar;
    }
};

2. 前缀积数组+后缀值

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int len = nums.size();
        vector<int> answar(len,1);
        int right = 1;

        for(int i = 1;i<len;++i){
            answar[i] = answar[i-1]*nums[i-1];
        }
        for(int i = len-1;i>=0;--i){
            answar[i] = answar[i] * right;
            right *= nums[i];
        }
        return answar;
    }
};

3. 前缀积值+后缀积值

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int len = nums.size();
        vector<int> answar(len,1);
        int right = 1,left = 1;

        for(int i = 0;i<len;++i){
            answar[i] *= left;
            left *= nums[i];

            answar[len-1-i] *= right;
            right *= nums[len-1-i];
        }
        
        return answar;
    }
};

• 学习总结
  前缀和，后缀和，前缀值，后缀值