算法-array-6-ReshapetheMatrix

幸运的stone1

于 2017-08-02 15:07:15 发布

阅读量235

点赞数

CC 4.0 BY-SA版权

分类专栏：算法与数据结构文章标签：算法

本文链接：https://blog.csdn.net/qq_34307506/article/details/76577581

算法与数据结构专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种通过排序和选择每对最小值的方法来解决数组配对求和问题，以达到最大化的配对求和结果。

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

package leet.array;

import java.util.Arrays;

public class ArrayPartition1 {
/*
题目要求：

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:

1.n is a positive integer, which is in the range of [1, 10000].
2.All the integers in the array will be in the range of [-10000, 10000].
【思路】
1.先排序
2.因为是两两一组，那么统计奇数下标就可以了。

*/
    public int arrayPartition(int[] nums){
        int result = 0;
        Arrays.sort(nums);
        for (int i = 0; i < nums.length; i+=2) {
            result += nums[i];
        }
        return result;
    }
    public static void main(String[] args){
        ArrayPartition1 arrayPartition1 = new ArrayPartition1();
        int[] nums = {1,3,4,20};
        System.out.println(arrayPartition1.arrayPartition(nums));
    }

}