LeetCode – 561. Array Partition I

Given an array of 2n integers, your task is to group these integers into n Pairs of integers, say (a₁, b₁), (a₂, b₂), …, (a_n, b_nwhich makes sum of min(a)_i, b_i) 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].

This is a really boring question.

public class Solution { public int arrayPairSum(int[] nums) { Arrays.sort(nums); int res = 0; int i=0; while(i 
This siteOriginal articleAll follow "Attribution-NonCommercial-ShareAlike 4.0 License (CC BY-NC-SA 4.0)Please retain the following annotations when sharing or adapting:
 
Original author:Jake Tao,source:「LeetCode – 561. Array Partition I」