[leetcode]-561. Array Partition I（C语言）

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

void sort(int *nums,int l,int r)
{
    if(l>=r)
        return;
    int i=l,j=r;
    int k=nums[l];
    while(i<j)
    {
        while(i<j&&nums[j]>=k)
            j--;
        if(i<j)
        {
            nums[i]=nums[j];
            i++;
        }
        while(i<j&&nums[i]<k)
            i++;
        if(i<j)
        {
            nums[j]=nums[i];
            j--;
        }
    }
    nums[i]=k;
    sort(nums,l,i-1);
    sort(nums,i+1,r);
}
int arrayPairSum(int* nums, int numsSize) {
    int i,j,k,tem;
    int sum=0;
    sort(nums,0,numsSize-1);
    for(i=0;i<numsSize;i++)
        if(i%2==0)
            sum+=nums[i];
    return sum;
}