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:
- 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.
给定一个数组,求出数组的三个数组的最大乘积。
一开始没考虑那么多,就想着排序之后取最后三个数字的乘积应该就是最大的了。但是还有负数。。
考虑负数之后,在原有思路的基础上,想到:
既然是三个数的乘积,肯定要取最大的那一个,再和第二大,第三大的数乘积 与 第一小,第二小的乘积 比较,取较大的就可以了。
具体怎么取出这几个数:
1. 快速排序之后取(O (nlogn))
2. 遍历一边过程中取出 (O(n))
解法一:
class Solution {
public int maximumProduct(int[] nums) {
Arrays.sort(nums);
int length = nums.length;
if (nums[0]*nums[1] < nums[length-3]*nums[length-2])
return nums[length-1]*nums[length-2]*nums[length-3];
else return nums[length-1]*nums[0]*nums[1];
}
}
解法二:
class Solution {
public int maximumProduct(int[] nums) {
int min1 = Integer.MAX_VALUE,min2 = Integer.MAX_VALUE;
int max1 = Integer.MIN_VALUE,max2 = Integer.MIN_VALUE,max3 = Integer.MIN_VALUE;
for (int n : nums) {
if (n < min1) {
min2 = min1;
min1 = n;
}else if (n < min2) {
min2 = n;
}
if (n > max1) {
max3 = max2;
max2 = max1;
max1 = n;
}else if (n > max2) {
max3 = max2;
max2 = n;
}else if (n > max3) {
max3 = n;
}
}
return Math.max(min1*min2*max1,max1*max2*max3);
}
}