Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public:
- vector<int> productExceptSelf(vector<int>& nums) {
- int n = nums.size();
- vector<int> rightProd(n,1);
- vector<int> leftProd(n,1);
- for(int i = n-2; i>=0; i--){
- rightProd[i] = rightProd[i+1]*nums[i+1];
- }
- for(int i = 1; i<n; i++){
- leftProd[i] = leftProd[i-1]*nums[i-1];
- }
- for(int i = 0; i<n; i++){
- nums[i] = rightProd[i]*leftProd[i];
- }
- return nums;
- }
- };
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement