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.
组成最大乘积的三个数,只可能出现在正序排列后的最后三个元素和第一、二个元素这五个元素中间,因为存在负数的情况,根据数列特征可以列出不同情况下应该是哪三个相乘,这里偷懒直接取出五个数进行枚举遍历求出。
void swap(int& e1, int& e2){
int tmp = e1;e1 = e2;
e2 = tmp;
}
void quickSort(vector<int>& a, int l, int r){ //c语言改成int*
if(l >= r) return;
int ref = a[l];
int lt = l;
int gt = r;
int i = l + 1;
while(i<=gt){
if(a[i] < ref) swap(a[i++], a[lt++]);
else if(a[i] > ref) swap(a[i], a[gt--]);
else ++i;
}
quickSort(a, l, lt - 1);
quickSort(a, gt + 1, r);
}
int maximumProduct(vector<int>& nums) {
quickSort(nums,0,nums.size()-1);
vector<int> temp;
if(nums.size()<=4){
for(int i=0;i<nums.size();i++){
temp.push_back(nums[i]);
}
}
else{
temp.push_back(nums[0]);
temp.push_back(nums[1]);
temp.push_back(nums[nums.size()-1]);
temp.push_back(nums[nums.size()-2]);
temp.push_back(nums[nums.size()-3]);
}
int max=temp[0]*temp[1]*temp[2];
for(int i=0;i<temp.size();i++){
for(int j=i+1;j<temp.size();j++){
for(int k=j+1;k<temp.size();k++){
if(temp[i]*temp[j]*temp[k]>max) max=temp[i]*temp[j]*temp[k];
}
}
}
return max;
}