【问题描述】
Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), ..., (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as possible.
Example 1:
Input: [1,4,3,2] Output: 4 Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
Note:
- n is a positive integer, which is in the range of [1, 10000].
- All the integers in the array will be in the range of [-10000, 10000].
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
}
};
【翻译】如果给你一个含有2n个整数元素的数组,要你将它们分成n组,每组包含两个元素,如(a1, b1), (a2, b2), ..., (an, bn),现要使这样得到的组合满足每组的最小值加起来构成的数值最大。
如1:
输入: [1,4,3,2] 输出: 4 解释: n 为 2, 最大的数值结果为4,其是这样得来的 4 = min(1, 2) + min(3, 4).
注意:
- n 为正整数,其取值范围在[1, 10000];
- 数组中所有元素的取值范围均为 [-10000, 10000]。
【解题思路】
既然要使是每组最小值之和最大,那么一定要想办法让每组的最小值尽可能的大咯,所以就要让每组的两个数值尽可能相等或是为邻近的数字,很显然就会想到现将数组进行排序,然后再按序进行分组。
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
sort(nums.begin(),nums.end());
int sum = 0;
for(int i = 0;i < nums.size();i += 2)
{
sum += min(nums[i],nums[i+1]);
}
return sum;
}
};