Solve in 28.8 and 29.8

Author: ngocquanai

238. Product of Array Except Self.py

@@ -0,0 +1,20 @@
+class Solution:
+    def productExceptSelf(self, nums):
+        product_array = [1] * len(nums)
+        product_array[0] = 1
+        product_array[1] = nums[0]
+        # Base case
+        if len(nums) == 2:
+            return [nums[1], nums[0]]
+
+        # After for loop, # product_array[i] store the product of element from index 0 to the index i - 1
+        for i in range(2, len(nums)):
+            product_array[i] = product_array[i - 1] * nums[i - 1]
+
+        current_const = 1
+        # After second for loop we got the final output
+        for i in range(len(nums) - 2, -1, -1):
+            current_const *= nums[i + 1]
+            product_array[i] *= current_const
+
+        return product_array

283. Move Zeroes.py

@@ -0,0 +1,15 @@
+class Solution:
+    def moveZeroes(self, nums):
+        """
+        Do not return anything, modify nums in-place instead.
+        """
+        n = len(nums)
+        total_zeros = 0
+        for i in range(n):
+            if nums[i] == 0:
+                total_zeros += 1
+                continue
+            nums[i - total_zeros] = nums[i]
+
+        for i in range(n - total_zeros, n):
+            nums[i] = 0