152. Maximum Product Subarray

src/main/java/Array/MaximumProductSubarray.java

@@ -0,0 +1,14 @@
+package Array;
+public class MaximumProductSubarray {
+    public int maxProduct(int[] nums) {
+        int max =nums[0];
+        int currentMax = nums[0], currentMin = nums[0];
+        for (int i = 1; i < nums.length; i++) {
+            int tempMax = currentMax;
+            currentMax = Math.max(Math.max(currentMax *nums[i], currentMin*nums[i]),nums[i] );
+            currentMin = Math.min(Math.min(tempMax*nums[i],currentMin*nums[i]), nums[i]);
+            max = Math.max(currentMax,max);
+        }
+        return max;
+    }
+}

src/test/java/TestMaximumProductSubarray.java

@@ -0,0 +1,35 @@
+import Array.MaximumProductSubarray;
+import org.junit.Assert;
+import org.junit.Before;
+import org.junit.Test;
+
+public class TestMaximumProductSubarray {
+
+    private MaximumProductSubarray maximumProductSubarray;
+
+    @Before
+    public void SetUp() {
+        maximumProductSubarray = new MaximumProductSubarray();
+    }
+
+    @Test
+    public void TestCase1() {
+        int[] nums = {2, 3, -2, 4};
+        int expectedOutput = 6;
+        Assert.assertEquals(expectedOutput,maximumProductSubarray.maxProduct(nums));
+    }
+
+    @Test
+    public void TestCase2() {
+        int[] nums = {-2,0,-1};
+        int expectedOutput = 0;
+        Assert.assertEquals(expectedOutput,maximumProductSubarray.maxProduct(nums));
+    }
+    @Test
+    public void TestCase3() {
+        int[] nums = {2,-5,-2,-4,3};
+        int expectedOutput = 24;
+        Assert.assertEquals(expectedOutput,maximumProductSubarray.maxProduct(nums));
+    }
+
+}