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].
给定长度为 2n 的数组, 你的任务是将这些数分成 n 对, 例如 (a1, b1), (a2, b2), ..., (an, bn) ,使得从1 到 n 的 min(ai, bi) 总和最大。
示例 1:
输入: [1,4,3,2] 输出: 4 解释: n 等于 2, 最大总和为 4 = min(1, 2) + min(3, 4).
提示:
- n 是正整数,范围在 [1, 10000].
- 数组中的元素范围在 [-10000, 10000].
思路一:将数组排序,然后隔项相加即可。时间复杂度O(nlog2n)
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum = 0;
int n = nums.length;
for(int i = 0; i < n; i+=2){
sum += nums[i];
}
return sum;
}
}
思路二:采用计数排序的思想,再进行相加,时间复杂度O(n)
class Solution {
public int arrayPairSum(int[] nums) {
int []temp = new int[20001];
for(int i : nums){
temp[i + 10000] += 1;
}
int sum = 0;
boolean odd = true;
for(int i = 0 ; i < temp.length ;i++){
while ( temp[i] > 0){
if(odd){
sum += i - 10000;
odd = false;
}else{
odd = true;
}
temp[i]--;
}
}
return sum;
}
}