Leetcode 628（Java）

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:
The length of the given array will be in range [3,104] and all elements are in the range [-1000, 1000].
Multiplication of any three numbers in the input won’t exceed the range of 32-bit signed integer.

在solution区看见个很聪明的解法，先将数组排序。在前三个，后三个，前一后二，以及前二后一的乘机之前取最大值即可。AC码：

public class Solution {
    public int maximumProduct(int[] nums) {
        Arrays.sort(nums);
        int length = nums.length;
        int result = nums[0]*nums[1]*nums[2];
        result = Math.max(result,nums[0]*nums[1]*nums[length-1]);
        result = Math.max(result,nums[0]*nums[length-1]*nums[length-2]);
        result = Math.max(result,nums[length-1]*nums[length-2]*nums[length-3]);
        return result;
    }
}