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.
思路:
求三个数的最大乘积,要考虑数值为正还是为负。首先可以利用Arrays.sort()进行排序,得到最大值。如果最大值为负值,则数组中所有的值都为负值,最大的乘积就是最后三位数字的乘积;如果最大值为正值,则数组中可能存在负值,若都为正值,最大乘积为最后三位的乘积,若存在负值,可能最大值为最大数与前两位的乘积。
public class Solution {
public int maximumProduct(int[] nums) {
if (nums == null || nums.length == 0) {
return 0;
}
Arrays.sort(nums);
int a = nums[nums.length - 1] * nums[nums.length - 2] * nums[nums.length - 3];
int b = nums[0] * nums[1] * nums[nums.length - 1];
return a > b ? a : b;
}
}