561. Array Partition I

最新推荐文章于 2020-11-29 01:28:22 发布

林下溪源

最新推荐文章于 2020-11-29 01:28:22 发布

阅读量86

点赞数

分类专栏： LeetCode # Arrays 文章标签： LeetCode 算法 Java

本文链接：https://blog.csdn.net/zzyy17/article/details/103239439

版权

LeetCode 同时被 2 个专栏收录

117 篇文章 0 订阅

订阅专栏

Arrays

79 篇文章 0 订阅

订阅专栏

Problem Description:

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

Analysis:

本题的思路就是先排序，然后按照顺序依次取每两个数为一对，然后把所有第一个数相加。代码如下：

Code:

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