LeetCode Product of Array Except Self Solution

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