本文介绍了一种高效算法，用于找出整数数组中三个数的最大乘积，并提供了具体的实现示例。该算法首先对数组进行排序，然后考虑最大的三个正数与最小的两个负数和一个最大正数之间的乘积比较。
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.
Solution：
class Solution {
public:
int maximumProduct(vector<int>& nums) {
std::sort(nums.begin(), nums.end());
int a = nums[0]*nums[1]*nums[nums.size()-1];
int b = nums[nums.size()-3]*nums[nums.size()-2]*nums[nums.size()-1];
return max(a,b);
}
};
public:
int maximumProduct(vector<int>& nums) {
std::sort(nums.begin(), nums.end());
int a = nums[0]*nums[1]*nums[nums.size()-1];
int b = nums[nums.size()-3]*nums[nums.size()-2]*nums[nums.size()-1];
return max(a,b);
}
};
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
