238. Product of Array Except Self

238. Product of Array Except Self

Given an array nums of n integers where n > 1,  return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:

Input:  [1,2,3,4]
Output: [24,12,8,6]

Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

 

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