Add solution #152

Author: JoshCrozier

README.md

@@ -13,6 +13,7 @@
 66|[Plus One](./0066-plus-one.js)|Easy|
 67|[Add Binary](./0067-add-binary.js)|Easy|
 151|[Reverse Words in a String](./0151-reverse-words-in-a-string.js)|Medium|
+152|[Maximum Product Subarray](./0152-maximum-product-subarray.js)|Medium|
 226|[Invert Binary Tree](./0226-invert-binary-tree.js)|Easy|
 263|[Ugly Number](./0263-ugly-number.js)|Easy|
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|

solutions/0152-maximum-product-subarray.js

@@ -0,0 +1,23 @@
+/**
+ * 152. Maximum Product Subarray
+ * https://leetcode.com/problems/maximum-product-subarray/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums, find the contiguous subarray within an array
+ * (containing at least one number) which has the largest product.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxProduct = function(nums) {
+  let result = nums[0];
+  let min = 1;
+  let max = 1;
+  for (let n of nums) {
+    [min, max] = [Math.min(n, min * n, max * n), Math.max(n, min * n, max * n)];
+    result = Math.max(result, max);
+  }
+  return result;
+};