Maximum Product Subarray

 1 public class Solution {
 2     public int maxProduct(int[] nums) 
 3     {
 4         int max=nums[0];
 5         int min=nums[0];
 6         int maxAns=nums[0];
 7         
 8         for(int i=1;i<nums.length;i++)
 9         {
10             int mx=max;
11             int mn=min;
12             max=Math.max(Math.max(nums[i],mx*nums[i]),mn*nums[i]);
13             min=Math.min(Math.min(nums[i],mx*nums[i]),mn*nums[i]);
14             maxAns=Math.max(max,maxAns);    
15         }
16         
17         return maxAns;
18     }
19 }