Problem 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:
- 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.
Analysis:
本题的思路是首先进行排序。在进行相乘的时候需要注意负数的情况,此处需要考虑两种情况,一种是所有数值都是正数,另一种就是两个负数一个正数。比较这两个值得大小即可。
Code:
class Solution {
public int maximumProduct(int[] nums) {
Arrays.sort(nums);
if(nums.length < 3)
return 0;
int maxValue = nums[0]*nums[1]*nums[2];
maxValue = Math.max(maxValue, nums[nums.length - 1]*nums[nums.length - 2]*nums[nums.length - 3]);
maxValue = Math.max(maxValue, nums[0]*nums[1]*nums[nums.length - 1]);
return maxValue;
}
}