leetcode 561. Array Partition I

a1025461748

于 2017-04-24 21:01:39 发布

阅读量1.4k

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode练习

本文链接：https://blog.youkuaiyun.com/a1025461748/article/details/70662964

Leetcode练习专栏收录该内容

294 篇文章

订阅专栏

本文介绍了一种通过排序并选择每对最小值来解决数组配对求和问题的方法。输入包含2n个整数，任务是将这些整数配对成n组，使得所有配对中最小值之和尽可能大。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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].

题目没看懂。。。结果就是求和一对中的最小值，排序取单数项即可

public class Solution {
    public int arrayPairSum(int[] nums) {
        Arrays.sort(nums);
        
        int sum=0;
        for(int i=0; i<nums.length; i+=2){
            sum += nums[i];
        }
        return sum;
    }
}