题目:
代码:
int cmp(const void* a, const void* b){
return *(int*)a - *(int*)b;
}
int minPairSum(int* nums, int numsSize){
int n = numsSize / 2;
qsort(nums, numsSize, 4, cmp);
int sum = nums[n - 1] + nums[n];
while(n--){
sum = sum > (nums[n] + nums[numsSize - 1 - n]) ? sum : (nums[n] + nums[numsSize - 1 - n]);
}
return sum;
}
解题思路:
基本靠猜 排序 最大加最小