Time: 22 ms (67.12%), Space: 23.2 MB (93.73%) - LeetHub

Author: wlsgur11

0238-product-of-array-except-self/0238-product-of-array-except-self.py

@@ -0,0 +1,14 @@
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        ans = [1] * n
+        
+        for i in range(1, n):
+            ans[i] = ans[i - 1] * nums[i - 1]
+        
+        right = 1
+        for i in range(n - 1, -1, -1):
+            ans[i] *= right
+            right *= nums[i]
+        
+        return ans