Given an integer array nums
of 2n
integers, group these integers into n
pairs (a1, b1), (a2, b2), ..., (an, bn)
such that the sum of min(ai, bi)
for all i
is maximized. Return the maximized sum.
Example 1:
Input: nums = [1,4,3,2] Output: 4 Explanation: All possible pairings (ignoring the ordering of elements) are: 1. (1, 4), (2, 3) -> min(1, 4) + min(2, 3) = 1 + 2 = 3 2. (1, 3), (2, 4) -> min(1, 3) + min(2, 4) = 1 + 2 = 3 3. (1, 2), (3, 4) -> min(1, 2) + min(3, 4) = 1 + 3 = 4 So the maximum possible sum is 4.
Example 2:
Input: nums = [6,2,6,5,1,2] Output: 9 Explanation: The optimal pairing is (2, 1), (2, 5), (6, 6). min(2, 1) + min(2, 5) + min(6, 6) = 1 + 2 + 6 = 9.
Constraints:
1 <= n <= 104
nums.length == 2 * n
-104 <= nums[i] <= 104
题目要求把一个array变成两两一对,小的那个元素加起来之和要最大。这个有点脑筋急转弯了,因为不管怎么样最小的元素都会被算进去,所以应该尽可能地把和它最接近的元素和它凑一对,所以就是排序以后每次取两个里最小的就行。感觉这题意义不大。看solutions还有一种counting sort的解法,就是新建一个数组把所有可能的元素都按index放进去,然后也是按照上面的思路,隔一个取一个,感觉也没啥意义……就是好像时间复杂度会是O(n)而Arrays.sort()是O(nlogn)?
Runtime: 21 ms, faster than 53.66% of Java online submissions for Array Partition.
Memory Usage: 53.4 MB, less than 76.93% of Java online submissions for Array Partition.
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int result = 0;
for (int i = 0; i < nums.length; i += 2) {
result += nums[i];
}
return result;
}
}