solves maximum product of three numbers

Author: anishLearnsToCode

Diff for: README.md

@@ -163,7 +163,7 @@
 | 606 | [Construct String from Binary Tree](https://leetcode.com/problems/construct-string-from-binary-tree) | [![Java](assets/java.png)](src/ConstructStringFromBinaryTree.java) [![Python](assets/python.png)](python/construct_string_from_binary_tree.py) |
 | 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [![Java](assets/java.png)](src/MergeTwoBinaryTrees.java) [![Python](assets/python.png)](python/merge_two_binary_trees.py) |
 | 624 | 🔒 [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | |
-| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | |
+| 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [![Java](assets/java.png)](src/MaximumProductOfThreeNumbers.java) [![Python](assets/python.png)](python/maximum_product_of_three_numbers.py) |
 | 633 | [Sum Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | |
 | 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | |
 | 643 | [Maximum Average SubArray I](https://leetcode.com/problems/maximum-average-subarray-i) | |

Diff for: python/maximum_product_of_three_numbers.py

@@ -0,0 +1,24 @@
+from typing import List
+
+
+class Solution:
+    def maximumProduct(self, array: List[int]) -> int:
+        positive_1, positive_2, positive_3 = (-float('inf'), ) * 3
+        negative_1, negative_2 = (float('inf'), ) * 2
+        for number in array:
+            if number > positive_1:
+                positive_3 = positive_2
+                positive_2 = positive_1
+                positive_1 = number
+            elif number > positive_2:
+                positive_3 = positive_2
+                positive_2 = number
+            elif number > positive_3:
+                positive_3 = number
+            if number < negative_1:
+                negative_2 = negative_1
+                negative_1 = number
+            elif number < negative_2:
+                negative_2 = number
+
+        return max(positive_1 * positive_2 * positive_3, negative_1 * negative_2 * positive_1)

Diff for: src/MaximumProductOfThreeNumbers.java

@@ -0,0 +1,28 @@
+public class MaximumProductOfThreeNumbers {
+    public int maximumProduct(int[] numbers) {
+        int positive1 = Integer.MIN_VALUE, positive2 = Integer.MIN_VALUE, positive3 = Integer.MIN_VALUE,
+                negative1 = Integer.MAX_VALUE,
+                negative2 = Integer.MAX_VALUE;
+
+        for (int number : numbers) {
+            if (number > positive1) {
+                positive3 = positive2;
+                positive2 = positive1;
+                positive1= number;
+            } else if (number > positive2) {
+                positive3 = positive2;
+                positive2 = number;
+            } else if (number> positive3) {
+                positive3 = number;
+            }
+            if (number < negative2) {
+                negative1 = negative2;
+                negative2 = number;
+            } else if (number < negative1) {
+                negative1 = number;
+            }
+        }
+
+        return Math.max(positive1 * positive2 * positive3, negative1 * negative2 * positive1);
+    }
+}