Product of Array Except Self

238. Product of Array Except Self


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].


require: solve it without division and in O(n)
e.g. given [1,2,3,4], return [24,12,8,6]


strategy: create the output array
          traverse the actual array from right to left store the left side number cumulative product into output.
          traverse the actual array from left to right multiply answer array with left side number cumulative products.
          code passing all the test cases with O(n) time and O(1) space complexity(excluding output itself)
public class Solution{
   public int[] productExceptSelf(int[] nums){
        int len = nums.length;
        int[]output = new int[len];
        int leftMult=1, rightMult=1;
        for(int i=len-1; i>=0; i--){
            output[i]=rightMult;
            rightMult *= nums[i];
        }
        for(int j=0;j<len;j++){
            output[j] *= leftMult;
            leftMult *= nums[j];
        }
        return output;
   }
}