题目链接:
https://leetcode-cn.com/problems/maximum-product-of-three-numbers/
算法描述:
三个数的最大乘积,只有两种可能,要么是最大的三个数,要么是最小的两个和最大的数的乘积
方法一:先排序,然后比较大小,但是时间复杂度取决于排序的时间复杂度
class Solution {
public int maximumProduct(int[] nums) {
int len = nums.length;
Arrays.sort(nums);
return Math.max(nums[0]*nums[1]*nums[len-1],nums[len-1]*nums[len-2]*nums[len-3]);
}
}
方法二:只需要线性扫描数组,然后找出对应的 min1<min2<max3<max2<max1,比较大小
public 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) { // n lies between min1 and min2
min2 = n;
}
if (n >= max1) { // n is greater than max1, max2 and max3
max3 = max2;
max2 = max1;
max1 = n;
} else if (n >= max2) { // n lies betweeen max1 and max2
max3 = max2;
max2 = n;
} else if (n >= max3) { // n lies betwen max2 and max3
max3 = n;
}
}
return Math.max(min1 * min2 * max1, max1 * max2 * max3);
}
}