题目描述:
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].
class Solution {
public int arrayPairSum(int[] nums) {
//sort the array ascendingly
//pick the smaller number in each grp
//add all of them
//that means add each element whose index is 2n
Arrays.sort(nums);
int count = 0, i = 0;
while(i < nums.length){
count += nums[i];
i=i+2;
}
return count;
}
}