Leetcode-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 = min(1, 2) + min(3, 4).
Note:
n is a positive integer, which is in the range of [1, 10000].
All the integers in the array will be in the range of [-10000, 10000].

很容易想到如果先排序的话，结果是很容易求得的。

/* quick sort,chose the first element be the pivot */
int findPivot(int *nums,int low,int high)
{
    int tmp = nums[low];
    while(low<high)
    {
        while(low<high && nums[high]>=tmp)
            high--;
        nums[low] = nums[high];
        while(low<high && nums[low]<=tmp)
            low++;
        nums[high] = nums[low];
    }
    nums[low] = tmp;
    return low;
}

void quickSort(int *nums,int low,int high)
{
    if(low<high)
    {
        int pos = findPivot(nums,low,high);
        quickSort(nums,low,pos-1);
        quickSort(nums,pos+1,high);
    }
}

int arrayPairSum(int* nums, int numsSize) {
    if(numsSize<3)return nums[0]<nums[1]?nums[0]:nums[1];
    quickSort(nums,0,numsSize-1);
    int i=0,sum=0;
    for(;i<numsSize;i+=2)
    {
        sum+=nums[i];
    }
    return sum;
}

但是题目中是给了所有数值的范围的，这种情况下可以考虑桶排序（bucket sort），可以实现O(N)时间复杂度。

int arrayPairSum(int* nums, int numsSize) {
    int bucket[20001] = {0};
    for(int i=0;i<numsSize;i++)
        bucket[nums[i]+10000]++;
    int sum=0,flag=1;
    for(int i=0;i<20001;)
    {
        if(flag==1&&bucket[i])
        {
            sum+=i-10000;
            flag=0;
            bucket[i]--;//处理好有重复值的情况 如case [1,2,3,2]
        }
       else if(flag==0&&bucket[i])
        {
            flag=1;
           bucket[i]--;//处理好有重复值的情况
        }
        else
            i++;
    }
    return sum;
}

C语言刷题实在是麻烦。。。