solves maximum product sub array in java

Author: anishLearnsToCode

README.md

@@ -135,7 +135,7 @@
 | 148  | [Sort List](https://leetcode.com/problems/sort-list)                                                                                                      |                                                                    [![Java](assets/java.png)](src/SortList.java)                                                                     |                                                                                                                                   |
 | 150  | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation)                                                        |                                                          [![Java](assets/java.png)](src/EvaluateReversePolishNotation.java)                                                          |                                                                                                                                   |
 | 151  | [Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)                                                                      |                                                              [![Java](assets/java.png)](src/ReverseWordsInAString.java)                                                              |                                                                                                                                   |
-| 152  | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)                                                                        |                                                                                                                                                                                      |                                                                                                                                   |
+| 152  | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)                                                                        |                                                             [![Java](assets/java.png)](src/MaximumProductSubarray.java)                                                              |                                                                                                                                   |
 | 153  | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)                                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 155  | [Min Stack](https://leetcode.com/problems/min-stack)                                                                                                      |                                          [![Java](assets/java.png)](src/MinStack.java) [![Python](assets/python.png)](python/min_stack.py)                                           |                                                                                                                                   |
 | 156  | 🔒 [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down)                                                                       |                                                                                                                                                                                      |                                                                                                                                   |

src/HelloWorld.java

@@ -1,5 +1,7 @@
 public class HelloWorld {
     public static void main(String[] args) {
-        System.out.println(ReverseWordsInAString.reverseWords("   hello   world  "));
+        System.out.println(
+                MaximumProductSubarray.maxProduct(new int[] {-4, -3, -2})
+        );
     }
 }

src/MaximumProductSubarray.java

@@ -0,0 +1,25 @@
+// https://leetcode.com/problems/maximum-product-subarray
+// T: O(N)
+// S: O(1)
+
+public class MaximumProductSubarray {
+    public static int maxProduct(int[] nums) {
+        int max = nums[0], min = nums[0], maxSoFar = max, temp;
+        for (int i = 1 ; i < nums.length ; i++) {
+            int number = nums[i];
+            temp = max(max * number, min * number, number);
+            min = min(max * number, min * number, number);
+            max = temp;
+            maxSoFar = Math.max(maxSoFar, max);
+        }
+        return maxSoFar;
+    }
+
+    private static int max(int a, int b, int c) {
+        return Math.max(a, Math.max(b, c));
+    }
+
+    private static int min(int a, int b, int c) {
+        return Math.min(a, Math.min(b, c));
+    }
+}