Product of Array Except Self

c++

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

https://leetcode.com/discuss/94629/my-one-pass-java-solution-without-extra-spaces