题目描述:
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) {
std::sort(nums.begin(), nums.end());
int sum = 0;
for (int i = 0; i < nums.size(); i = i + 2) {
sum += nums[i];
}
return sum;
}
};
上述的解法当然是可行的,但是排序算法的复杂度是没办法到O(n)的,因此可以用下述代码,用空间换时间:
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
vector<int> hashtable(20001, 0);
for (size_t i = 0; i<nums.size(); i++)
{
hashtable[nums[i] + 10000]++;
}
int ret = 0;
int flag = 0;
for (size_t i = 0; i<20001;) {
if ((hashtable[i]>0) && (flag == 0)) {
ret = ret + i - 10000;
flag = 1;
hashtable[i]--;
}
else if ((hashtable[i]>0) && (flag == 1)) {
hashtable[i]--;
flag = 0;
}
else i++;
}
return ret;
}
};
/*
+10000是因为num[i]可能为负值,hashtable元素值为元素下标表示的值的个数。
*/