👔 product-of-array-except-self solution

dohee789 · dohee789 · commit caabec4a22cb · 2025-08-25T18:57:42.000+09:00
diff --git a/product-of-array-except-self/dohee789.java b/product-of-array-except-self/dohee789.java
@@ -0,0 +1,25 @@
+/*
+https://leetcode.com/problems/product-of-array-except-self/
+ */
+class Solution {
+    public int[] productExceptSelf(int[] nums) {
+        int n = nums.length;
+        int[] result = new int[n];
+
+        result[0] = 1;
+        for (int i = 1; i < n; i++) {
+            result[i] = result[i - 1] * nums[i - 1];
+        }
+
+        int right = 1;
+        for (int i = n - 1; i >= 0; i--) {
+            result[i] *= right;
+            right *= nums[i];
+        }
+
+        return result;
+    }
+}
+
+
+
