LeetCode 561. Array Partition I
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].
sum = min(a1, b1) + min(a2, b2) + ... + min(an, bn)
sum能够最大化。
分析:要使得两两数据的最小值之和最大化,必然在划分时需要尽可能的把较大的两个数划分在一起,例如,我们将数组从大到小排序,尽可能选取较大的数,最大的数必然不可能被选上,而第二大的数通过划分与最大的数划分在一起,以此类推,最终得到结果。时间复杂度为O(n)。
代码实现如下:
class Solution {
public:
int arrayPairSum(vector<int>& nums) {
vector<int> temp = nums;
sort(temp.begin(), temp.end());
int min = 0;
for (int i = 0; i < nums.size(); i = i + 2) {
min += temp[i];
}
return min;
}
};