Leetcode 561. Array Partition I （Java）

问题描述

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

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

解决方案

package test ;

import java.lang.* ;
import java.util.*;

class Solution {
    public int arrayPairSum(int[] nums) {
        Arrays.sort(nums);

        int len = nums.length ;
        int result = 0 ;
        for(int i = 0; i <= len - 1; i += 2){
            result += nums[i] ;
        }
        return result ;
    }
}

public class Test{
    public static void main(String[] args){
        Solution s = new Solution() ;
        int[] nums = {1, 4, 3, 2} ;
        System.out.println("The result is :" + s.arrayPairSum(nums)) ;
    }   
}

1. 思路：数组中的最小值和谁组成一对都会出现在求和中，和最大值组成一对的数值一定会出现在求和中，为使最后各对中最小值的和最大，则与最大值组成一对的值要尽可能的大，所以，理所当然这个值就是第二大的值。最后组成的对就是把数组按升序排序，相邻的两个数组成一对再求和即可
2. Array.sort(数组)是对数组进行优化后的快速排序，直接调用就好