Merge pull request neetcode-gh#167 from r1cky0/patch-13

Create 152-Maximum-Product-Subarray.java

Author: neetcode-gh

java/152-Maximum-Product-Subarray.java

@@ -0,0 +1,15 @@
+class Solution {
+    public int maxProduct(int[] nums) {
+        int res = nums[0];
+        int max = 1;
+        int min = 1;
+        
+        for (int n: nums) {
+            int tmp = max * n;
+            max = Math.max(n, Math.max(tmp, min * n));
+            min = Math.min(n, Math.min(tmp, min * n));
+            res = Math.max(res, max);
+        }
+        return res;
+    }
+}