乘积最大子数组

Posted 2022-01-31 Alice_yufeng

    public static int maxProduct(int[] nums) 
        int max = Integer.MIN_VALUE, min = Integer.MAX_VALUE, imax = 1, imin = 1;
        for(int i=0; i<nums.length; i++)
            if(nums[i] < 0)
                int tmp = imax;
                imax = imin;
                imin = tmp;
            
            imax = Math.max(imax*nums[i], nums[i]);
            imin = Math.min(imin*nums[i], nums[i]);

            max = Math.max(max, imax);
            min = Math.min(min, imin);
        
        return max;