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