modify code

Author: algorithmzuo

src/topinterviewquestions/Problem_0152_MaximumProductSubarray.java

@@ -6,7 +6,6 @@ public static int maxProduct(int[] nums) {
 		int ans = nums[0];
 		int min = nums[0];
 		int max = nums[0];
-		// [0]   
 		for (int i = 1; i < nums.length; i++) {
 			int curmin = Math.min(nums[i], Math.min(min * nums[i], max * nums[i]));
 			int curmax = Math.max(nums[i], Math.max(min * nums[i], max * nums[i]));