Leetcode: Product of Array Except Self



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

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

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

每个结果等于它左边的所有元素乘积，乘以它右边的所有元素乘积。数组遍历的时候用size_t递减的话需要注意，size_t总是大于0.

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