Description:
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].
Analysis:
m
i
n
{
a
i
,
b
i
}
=
a
i
+
b
i
2
−
b
i
−
a
i
2
min\{a_{i}, b_{i}\} = \frac{a_{i} + b_{i}}{2} - \frac{b_{i} - a_{i}}{2}
min{ai,bi}=2ai+bi−2bi−ai(Assume
a
i
≤
b
i
a_{i} \leq b_{i}
ai≤bi)
s
u
m
=
a
1
+
b
1
+
a
2
+
b
2
+
⋯
+
a
i
+
b
i
2
−
(
b
1
−
a
1
)
+
(
b
2
−
a
2
)
+
⋯
+
(
b
n
−
a
n
)
2
sum = \frac{a_{1} + b_{1} + a_{2} + b_{2} + \dots + a_{i}+ b_{i}}{2} - \frac{(b_{1} - a_{1}) + (b_{2} - a_{2}) + \dots +(b_{n} - a_{n})}{2}
sum=2a1+b1+a2+b2+⋯+ai+bi−2(b1−a1)+(b2−a2)+⋯+(bn−an)
To get the maximum of
s
u
m
sum
sum, we need to make sure
(
b
1
−
a
1
)
+
(
b
2
−
a
2
)
+
⋯
+
(
b
n
−
a
n
)
(b_{1} - a_{1}) + (b_{2} - a_{2}) + \dots +(b_{n} - a_{n})
(b1−a1)+(b2−a2)+⋯+(bn−an) is minimal. What’s more, if and only if the array is sorted in an increasing order,
(
b
1
−
a
1
)
+
(
b
2
−
a
2
)
+
⋯
+
(
b
n
−
a
n
)
(b_{1} - a_{1}) + (b_{2} - a_{2}) + \dots +(b_{n} - a_{n})
(b1−a1)+(b2−a2)+⋯+(bn−an) will be minimal.
Code:
class Solution {
public int arrayPairSum(int[] nums) {
Arrays.sort(nums);
int sum = 0;
for(int i = 0; i < nums.length; i+=2) {
sum += nums[i];
}
return sum;
}
}