LeetCode 238. Product of Array Except Self

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