[LeetCode] 628. Maximum Product of Three Numbers

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

题目

Given an integer array, find three numbers whose product is maximum and output the maximum product.

Example 1:

Input: [1,2,3]
Output: 6

Example 2:

Input: [1,2,3,4]
Output: 24

Note:

1. The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
2. Multiplication of any three numbers in the input won’t exceed the range of 32-bit signed integer.

题目大意

数组中取 3个数，使得 3个数的乘积最大。

思路

因为 ac<bc 当c>0 且 a<b

故有两个候选组合：

1. max1* max2* max3
2. max1* min1* min2

主要工作：从 数组中 获取上述 变量

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 num:nums){
            if(num>max1){
                max3 = max2;
                max2 = max1;
                max1 = num;
            }
            else if(num>max2){
                max3 = max2;
                max2 = num;
            }
            else if(num>max3)
                max3 = num;
            if(num<min1){
                min2 = min1;
                min1 = num;
            }
            else if(num<min2)
                min2 = num;
        }
        return Math.max(max1*max2*max3,max1*min1*min2);
    }
}