Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
Solve it without division and in O(n).
For example, given [1,2,3,4], return [24,12,8,6].
/**
* @param {number[]} nums
* @return {number[]}
*/
var productExceptSelf = function(nums) {
var nn = nums.length;
var output=[1];
var right_nums = 1;
for(var i=1;i<nn;i++){
output.push(output[i-1]*nums[i-1]);
}
for(i=nn-2;i>=0;i--){
right_nums *= nums[i+1];
output[i]=output[i]*right_nums;
}
return output;
};