关注 每天一道编程题 专栏,一起学习进步。
题目
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的数组,对里面的数进行两两配对,最后使的每对数的最小数之和最大。
比如给出的例子,正解是min(1, 2) + min(3, 4)=1+3=4.
错解有:min(1, 3) + min(2, 4)=1+2=3
min(1, 4) + min(2, 3)=1+2=3
难就难在,如何找出配对规律。
再举个例子,
[1,2,3,4,5,6]
不难得出,最后结果依旧是按升序排列的两两组合
结果最大,为1+3+5=9
因此,算法就是将给所给数组排序,最终求出下标为奇数位的和。
解答
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int res=0;
for(int i=0;i<nums.length;i+=2)
res+=nums[i];
return res;
}
}
速度太慢了,看看其他答案。
下面这个算法是O(n),最快的方式,可以借鉴一下。
public class Solution {
public int arrayPairSum(int[] nums) {
int[] exist = new int[20001];
for (int i = 0; i < nums.length; i++) {
// 由于nums[i]最小可为-10000,为保证索引正确,这里+10000
exist[nums[i] + 10000]++;
}
int sum = 0;
boolean odd = true;
for (int i = 0; i < exist.length; i++) {
while (exist[i] > 0) {
if (odd) {
// 上面加了10000,这里减去
sum += i - 10000;
}
odd = !odd;
exist[i]--;
}
}
return sum;
}
}