152. Maximum Product Subarray

public class Solution {
    public int maxProduct(int[] nums) {
        if(nums.length==0) return 0;
        int min=nums[0],max=nums[0],res=nums[0];
        for(int i=1;i<nums.length;i++){
            int temp=min;
            min=Math.min(Math.min(nums[i],min*nums[i]),nums[i]*max);
            max=Math.max(Math.max(nums[i],max*nums[i]),nums[i]*temp);
            if(res<max) res=max;
        }
        return res;
    }
}