Time: 292 ms (89.97%), Space: 45.4 MB (53.29%) - LeetHub

Author: cmcoffeedev

product-of-array-except-self/product-of-array-except-self.kt

@@ -0,0 +1,29 @@
+class Solution {
+    fun productExceptSelf(nums: IntArray): IntArray {
+        
+        val length = nums.size
+        
+        val left = IntArray(length)
+        val right = IntArray(length)
+        
+        val answer = IntArray(length)
+        
+        left[0] = 1
+        right[nums.size - 1] = 1
+        
+        for(i in 1 until length){
+            left[i] = nums[i - 1] * left[i - 1]
+        }
+        
+        for(i in length-2 downTo 0 ){
+            right[i] = nums[i + 1] * right[i + 1]
+        }
+        
+        for(i in 0 until nums.size){
+            answer[i] = left[i] * right[i]
+        }
+        
+        return answer
+        
+    }
+}