interviewcoder
diff --git a/‎src/_152_MaximumProductSubarray/Solution.java
Lines changed: 3 additions & 3 deletions b/‎src/_152_MaximumProductSubarray/Solution.java
Lines changed: 3 additions & 3 deletions
diff --git a/‎src/_152_MaximumProductSubarray/Solution2.java
Lines changed: 0 additions & 45 deletions b/‎src/_152_MaximumProductSubarray/Solution2.java
Lines changed: 0 additions & 45 deletions
diff --git a/‎test/_152_MaximumProductSubarray/Solution2Test.java
Lines changed: 0 additions & 71 deletions b/‎test/_152_MaximumProductSubarray/Solution2Test.java
Lines changed: 0 additions & 71 deletions
@@ -27,9 +27,9 @@ public int maxProduct(int[] nums) {
         }
         // initialize
         int res = nums[0];
-        int max = nums[0];
-        int min = nums[0];
-        // dp
+        int max = nums[0];  // max product that ending at current index
+        int min = nums[0];  // min product that ending at current index
+
         for (int i = 1; i < n; i++) {
             int num = nums[i];
             int lmax = max * num;