238. Product of Array Except Self [Medium]

https://leetcode.com/problems/product-of-array-except-self/

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]

Constraint: It's guaranteed that the product of the elements of any prefix or suffix of the array (including the whole array) fits in a 32 bit integer.

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

---

算法思路：

方法1：solve it with division

class Solution {
public:
    vector<int> productExceptSelf(vector<int>& nums) {
        int product = 1;
        int productWithNoZero = 1;
        int zeros = 0;
        int p = 0;
        int n = nums.size();
        vector<int> res(n, 0);
        for (int i = 0; i < n; i++) {
            if (nums[i] == 0) {
                zeros++; p = i;
            }
            if (zeros == 2) return res;
            product *= nums[i];
            if (nums[i] != 0) {
                productWithNoZero *= nums[i];
            }
        }
        if (zeros == 1) {
            res[p] = productWithNoZero;
            return res;
        }
        for (int i = 0; i < n; i++) {
            res[i] = product / nums[i];
        }
        return res;
    }
};

方法2：solve it without division

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