LeetCode 561. Array Partition I （排序、遍历）

最新推荐文章于 2023-04-01 21:00:00 发布

Hiroshiten

最新推荐文章于 2023-04-01 21:00:00 发布

阅读量235

点赞数

分类专栏： LeetCode # Easy 文章标签： leetcode

本文链接：https://blog.csdn.net/hiroshiten/article/details/72547969

版权

LeetCode 同时被 2 个专栏收录

37 篇文章 0 订阅

订阅专栏

Easy

33 篇文章 0 订阅

订阅专栏

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.

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, a2, a3,...,an，然后按顺序组对(a1,a2),(a3,a4)...，即可满足要求。

C++的代码输入是vector，调用sort函数直接排序，然后遍历。

参考：

vector排序： http://www.cppblog.com/mzty/archive/2005/12/15/1770.html

vector遍历： https://www.cnblogs.com/xylc/p/3653036.html

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