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.
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].
Subscribe to see which companies asked this question.
题目链接:点击打开链接
简单题,主要就是题目理解。2n长度的数组,两两一组,分成n组,在每组中找出最小的,并把最小数相加。
比如1,2,3,4可以分成1,2和3,4,分别选出最小数1和3相加的4。也可以分成1,3和2,4但是这样得出的结果是1和2相加,不是最佳结果。原因就是第二种方法浪费了3作为最小值得机会。所以解决方案就是把数组排序,相隔相加。
public static int arrayPairSum(int[] nums) {
int max=0;
Arrays.sort(nums);
for(int i=0;i<nums.length;i=i+2){
max += nums[i];
//System.out.println(nums[nums.length-i]);
}
return max;
}