[LeetCode]561.Flipping an Image 解题报告(C++)

本文链接：https://blog.csdn.net/qjh5606/article/details/81352696

[LeetCode]561.Flipping an Image 解题报告(C++)

题目描述

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)… 每一对的最小值之和越大越好.

解题思路

要使得最小值的和最大.
贪心的想法. 对于 (an,bn). an要最大.bn是整个数组中最大的. an就是第二大.以此类推.
直接降数组排序. 取 0..2..4..2n-2 索引号数字叠加.

代码实现:

int arrayPairSum(vector<int>& nums) {
    int size = nums.size();
    sort(nums.begin(),nums.end());
    int sum = 0;
    for (int i = 0; i < size; i += 2) {
        sum += nums[i];
    }
    return sum;
}