628. Maximum Product of Three Numbers

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.

求三个乘积最大，注意下负数的情况，两负*一正的情况也需要考虑。

1     public int maximumProduct(int[] nums) {
2          if (nums.length<3)
3             return Integer.MIN_VALUE;
4         Arrays.sort(nums);
5         int maxSum = nums[nums.length-1] * nums[nums.length-2] * nums[nums.length-3];
6         int minSum = nums[nums.length-1] * nums[0] * nums[1];
7         return Math.max(maxSum,minSum);
8     }

628. Maximum Product of Three Numbers

原文：http://www.cnblogs.com/wzj4858/p/7670262.html