leetcode561. Array Partition I

最新推荐文章于 2022-01-31 22:01:47 发布

大大kc

最新推荐文章于 2022-01-31 22:01:47 发布

阅读量273

点赞数

分类专栏： leetcode 文章标签： leetcode Array

本文链接：https://blog.csdn.net/rxt2012kc/article/details/73195688

版权

leetcode 专栏收录该内容

187 篇文章 0 订阅

订阅专栏

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

解法

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

        return ret;
    }
}