Time: 38 ms (97.94%), Space: 25 MB (96.97%) - LeetHub

2026-06-13 03:27:07 +00:00 · 2024-10-21 09:13:24 -04:00
parent 046de15e59
commit bab76ad214
1 changed files with 15 additions and 0 deletions
@@ -0,0 +1,15 @@
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+
+        left = [1] * len(nums)
+        right = [1] * len(nums)
+
+        for i in range(len(nums)):
+            if i > 0:
+                left[i] = left[i - 1] * nums[i - 1]
+            
+            if n - i < len(nums):
+                right[n - i - 1] = right[n - i] * nums[n - i]
+
+        return [left[i] * right[i] for i in range(len(nums))]