Maximum Product Subarray.java

class Solution {
    public int maxProduct(int[] nums) {
        int n= nums.length;
        int pref=1;
        int suff=1;
        int ans =Integer.MIN_VALUE;
        for(int i=0; i<nums.length;i++)
        {
            if(pref==0) pref=1;
            if(suff==0) suff=1;

            pref=pref*nums[i];
            suff= suff*nums[n-i-1];
            ans =Math.max(ans,Math.max(suff,pref));
        }
        return ans;
    }
}