min_product fix

harshalparekh6 · harshalparekh6 · commit 114541e7ef10 · 2020-05-03T04:11:20.000-05:00
diff --git a/data_structures/array/min_product.py b/data_structures/array/min_product.py
@@ -7,45 +7,44 @@
 # If there are odd number of negative numbers and no zeros,
 # the result is simply the product of all
 
-# If there is a zero and al other are positive, then the result is zero
+# If there is a zero and all other are positive, then the result is zero
 
 # If there are only positive numbers, the the result is
 # the smallest positive number
 
+
 def find(arr):
     if len(arr) == 1:
         return arr[0]
-    
+
     count_negative = 0
-    count_positive = 0
     count_zero = 0
     max_neg = float('-inf')
     min_pos = float('inf')
-    
+
     prod = 1
-    
+
     for num in arr:
         if num == 0:
             count_zero += 1
             continue
 
         if num < 0:
-            count_neg += 1
+            count_negative += 1
             max_neg = max(max_neg, num)
 
         if num > 0:
             min_pos = min(min_pos, num)
 
-        prod = prod * num
+        prod *= num
 
-    if count_zero == len(arr) or (count_neg == 0 and count_zero > 0):
+    if count_zero == len(arr) or (count_negative == 0 and count_zero > 0):
         return 0
-    
-    if count_neg == 0:
+
+    if count_negative == 0:
         return min_pos
 
-    if count_neg & 1 == 0 and count_neg != 0:
+    if count_negative & 1 == 0 and count_negative != 0:
         prod = int(prod / max_neg)
-    
-    return prod
 
+    return prod
