238 Product of Array Except Self

1 题目

Given an array nums of n integers where n > 1,  return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:

Input:  [1,2,3,4]
Output: [24,12,8,6]
Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

2 尝试解

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        //left_product[i] is the product of all left elements of nums[i], so it is[1,1,2,6]
        vector<int> left_product(nums.size(),1);
        for(int i = 1; i < nums.size(); i++){
            left_product[i] = left_product[i-1]*nums[i-1];
        }
        //right_product[i] is the product of all right elements of nums[i], so it is[24,12,4,1]
        vector<int> right_product(nums.size(),1);
        for(int i = nums.size()-2; i >= 0; i--){
            right_product[i] = right_product[i+1]*nums[i+1];
        }
        vector<int> result(nums.size(),1);
        for(int i = 0 ; i < nums.size(); i++){
            result[i] = left_product[i]*right_product[i];
        }
        return result;
    }
};

3 标准解

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int n=nums.size();
        int fromBegin=1;
        int fromLast=1;
        vector<int> res(n,1);
        
        for(int i=0;i<n;i++){
            res[i]*=fromBegin;
            fromBegin*=nums[i];
            res[n-1-i]*=fromLast;
            fromLast*=nums[n-1-i];
        }
        return res;
    }
};