238.除自身以外数组的乘积

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.)

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int numsSize=nums.size();
        vector<int> res(numsSize,1);
        int R=1;

        for(int i=1;i<numsSize;i+=1)
        {
            res[i]=res[i-1]*nums[i-1];
        }
        for(int i=numsSize-2;i>-1;i-=1)
        {
            R*=nums[i+1];
            res[i]*=R;
        }
        
        return res;
    }
};


class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        vector<int> res;
        int A=1, numsSize=nums.size();

        for(int i=0;i<numsSize;i++)
        {
            A*=nums[i];
        }

        for(int i=0;i<numsSize;i++)
        {
            if(nums[i]!=0)
                res.push_back(A/nums[i]);
            else
            {
                int B=1;
                for(int j=0;j<numsSize;j++)
                {
                    if(i!=j)
                    {
                        B*=nums[j];
                    }
                }
                res.push_back(B);
            }
        }

        return res;
    }
};