LeetCode--561--easy--ArrayPartitionI

最新推荐文章于 2024-01-26 01:55:06 发布

微观尽头

最新推荐文章于 2024-01-26 01:55:06 发布

阅读量83

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/huangdingsheng/article/details/102577170

版权

LeetCode 专栏收录该内容

199 篇文章 0 订阅

订阅专栏

package com.app.main.LeetCode;

import java.util.Arrays;

/**
 * 561
 *
 * easy
 *
 * 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].
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/10/13
 * Time:下午11:18
 */
public class ArrayPartitionI {

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