Merge pull request neetcode-gh#626 from LordKaT/main

Update 238-Product-of-Array-Except-Self.java

java/238-Product-of-Array-Except-Self.java

@@ -3,18 +3,31 @@
 //In first pass calculate the left product except self and in second calculate the right 
 
 class Solution {
+ public int[] productExceptSelf(int[] nums) {
+ int[] arr = new int[nums.length];
+ int right = 1, left = 1;
+ for (int i = 0; i < nums.length; i++) {
+ arr[i] = left;
+ left *= nums[i];
+ }
+ for (int i = nums.length - 1; i >= 0; i--) {
+ arr[i] *= right;
+ right *= nums[i];
+ }
+ return arr;
+ }
 
- public int[] productExceptSelf(int[] nums) {
- int[] arr = new int[nums.length];
- int right=1, left=1;
- for (int i = 0; i < nums.length; i++) {
- arr[i] = left;
- left *= nums[i];
- }
- for(int i = nums.length - 1; i >= 0; i--) {
- arr[i] *= right;
- right *= nums[i];
-  }
- return arr;
- }
+ public int[] productExceptSelfNumsAsPrefix(int[] nums) {
+ int[] output = new int[nums.length];
+ output[0] = 1;
+
+ for (int i = 0; i < nums.length - 1; i++)
+ output[i + 1] = output[i] * nums[i];
+
+ for (int i = nums.length - 2; i >= 0; i--) {
+ output[i] = nums[i + 1] * output[i];
+ nums[i] = nums[i] * nums[i + 1];
+  }
+ return output;
+ }
 }