561. Array Partition I*

最新推荐文章于 2024-11-13 11:37:20 发布

珍妮的选择

最新推荐文章于 2024-11-13 11:37:20 发布

阅读量166

点赞数

分类专栏： LeetCode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/Eric_1993/article/details/103535812

版权

LeetCode 专栏收录该内容

416 篇文章 4 订阅

订阅专栏

561. Array Partition I*

https://leetcode.com/problems/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].

解题思路

这道题的关键是要观察到这样一个现象: 较大的数要聚在一起, 那么 min(ai, bi) 才会比较大. 比如上面的例子中, 如果 4 和 1 组成数对, 那么 min(1, 4) 就是 1, 相比 min(3, 4) 就小了. 因此, 思路就是将这个数组排序, 然后将 0 ~ 2n - 1 索引中偶数位置的元素相加即可.

C++ 实现 1

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