[LeetCode] 628. Maximum Product of Three Numbers - Java

• 문제 링크

Maximum Product of Three Numbers - LeetCode

 

• 풀이 코드

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, min1 * min2 * max1);
    }

    /*public int maximumProduct(int[] nums) {
        Arrays.sort(nums);

        return Math.max(nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3], nums[0] * nums[1] * nums[nums.length - 1]);
    }*/

}