题目
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个整数,你的任务是将这些数字分成 n 对 数,形式为 (a1,b1), (a2,b2), ..., (an,bn)。这种分组需要使得所有min(ai, bi)的和最小,其中 1 <= i <= n。
分析及解答
算法
public 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;
}
}
证明
学习其证明方法。
- 【适当引入假设】下面证明中,引入了假设
bi >= ai。假设使得形式化表示更加方便。
- 【数学量化】通过数学的方式量化分析,分析出各个变量之间的关系,进而将目标转化为我们熟悉的目标(更加贴近观察变量的目标),下面证明中就是将最大化 Sm 问题转化为了最小化Sd的问题,而Sd较容易观察求得。
- 【引入常识】作者并没有用严格的数学证明来说明:为何相邻就是差最小的?而是用了显然,并且通过图的方式进行了说明。
Let me try to prove the algorithm...
- Assume in each pair
i
,bi >= ai
. - Denote
Sm = min(a1, b1) + min(a2, b2) + ... + min(an, bn)
. The biggestSm
is the answer of this problem. Given1
,Sm = a1 + a2 + ... + an
. - Denote
Sa = a1 + b1 + a2 + b2 + ... + an + bn
.Sa
is constant for a given input. - Denote
di = |ai - bi|
. Given1
,di = bi - ai
. DenoteSd = d1 + d2 + ... + dn
. - So
Sa = a1 + a1 + d1 + a2 + a2 + d2 + ... + an + an + di = 2Sm + Sd
=>Sm = (Sa - Sd) / 2
. To get the maxSm
, givenSa
is constant, we need to makeSd
as small as possible. - So this problem becomes finding pairs in an array that makes sum of
di
(distance betweenai
andbi
) as small as possible. Apparently, sum of these distances of adjacent elements is the smallest. If that's not intuitive enough, see attached picture. Case 1 has the smallestSd
.
。