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.

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

Subscribe to see which companies asked this question.

解析思路：

1、由（ai, bi）取较小值，然后求和所有（ai, bi），使得所求之和最大，也就是尽可能的取数组nums[]较大的值

2、对nums 自然排序，相邻元素作为（ai, bi），能够使得sum最大，至于为啥数学问题就不说了，可以自己脑补几个简单的小栗子类推，哈哈

代码：

public class Solution {
    public int arrayPairSum(int[] nums) {
        int n = nums.length;
        int sum=0;
        Arrays.sort(nums);
        if(n%2==1 || n<=0){
            return 0;	//如果出现这样的n会和正好和为0的冲突，应该是在输入的时候设置了nums.length,所以这里我是多此一举啦。。。。
        }
        else{
            for(int i=0;i<n;i++){
                if(i%2==0){	//排序后，取偶数为即为（ai, bi）中较小的数值
                    sum = sum + nums[i];
                }
            }
        }
        return sum;
    }
}