238. Product of Array Except Self - https://leetcode.com/problems/product-of-array-except-self/description/

gistfile1.txt

class Solution {
    public int[] productExceptSelf(int[] nums) {
      int[] results = new int[nums.length];
      
      int[] left = new int[nums.length];
      Arrays.fill(left, 1);
      
      // [1, 2, 3, 4]
      // [1, 1, 2, 6]
      for (int i = 1; i < nums.length; i++) {
        left[i] = left[i - 1] * nums[i - 1];
        
        // System.out.println("Left i " + i + " is " + left[i]);
      }

    
      int[] right = new int[nums.length];
      Arrays.fill(right, 1);
      
      // [1, 2, 3, 4]
      // [24 , 12, 4, 1]
      for (int j = (nums.length - 2) ; j >= 0; j--) {
        
        right[j] = right[j + 1] * nums[j + 1];
        
        //System.out.println("Right j " + j + " is " + right[j]);
      }
      
      // multiply lefyt and right
      for (int k = 0; k < nums.length ; k++) {
        System.out.println("Left k " + k + " is " + left[k]);
        System.out.println("Right k " + k + " is " + right[k]);
        results[k] = left[k] * right[k];
      }
      return results;
    }
}