payal-kothari
8/9/2017 - 8:25 PM

From https://leetcode.com/problems/maximum-product-of-three-numbers/description/ // array consists positive and negative numbers

From https://leetcode.com/problems/maximum-product-of-three-numbers/description/

// array consists positive and negative numbers

Maximum product of three numbers.java
content_copyfile_download
public class Solution {
     public int maximumProduct(int[] nums) {
        int max1 = Integer.MIN_VALUE, max2 = Integer.MIN_VALUE, max3 = Integer.MIN_VALUE, min1 = Integer.MAX_VALUE, min2 = Integer.MAX_VALUE;
        for (int n : nums) {
            if (n > max1) {
                max3 = max2;
                max2 = max1;
                max1 = n;
            } else if (n > max2) {
                max3 = max2;
                max2 = n;
            } else if (n > max3) {
                max3 = n;
            }

            if (n < min1) {
                min2 = min1;
                min1 = n;
            } else if (n < min2) {
                min2 = n;
            }
        }
        return Math.max(max1*max2*max3, max1*min1*min2);
    }
    
}