Leetcode - 152 product maximum subarray

Dynamic programming

class Solution {
    
    public int maxProduct(int[] nums) {
    
       int n = nums.length;
       int maxv = 1;
       int minv = 1;
       int ans = Integer.MIN_VALUE;
       for(int i = 0;i < n;i++){
    
           int premax = maxv;
           int premin = minv;
           if(nums[i] < 0){
    
              maxv = Math.max(premin*nums[i],nums[i]);
              minv = Math.min(premax*nums[i],nums[i]);
           }
           else{
    
                maxv = Math.max(premax*nums[i],nums[i]);
                minv = Math.min(premin*nums[i],nums[i]);
           }
           ans = Math.max(maxv,ans);
       }
       return ans;
    }
}