问题描述
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:
1. n is a positive integer, which is in the range of [1, 10000].
2. All the integers in the array will be in the range of [-10000, 10000].
思路分析
有2n个数的数组,求分两个一对之后的每一对的最小值的和的最大值是多少。
想要和最大,就要使每一对里最小的值最大,根据贪心的思想,我们要加上倒数第二大,倒数第四大的,……,以此类推。所以结果就是排序后的第0,2,4……个元素的和。
代码
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
sort(nums.begin(), nums.end());
int result = 0;
for (int i = 0; i < nums.size(); i += 2){
result += nums[i];
}
return result;
}
};
时间复杂度:
O(logn)
空间复杂度:
O(1)
反思
比较简单的题目。有用hash table 的利用note内容的去值范围的做法,不太喜欢,没有普适性。但是是 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;
}
};