https://leetcode-cn.com/problems/minimize-maximum-pair-sum-in-array/
附上贪心算法的证明
Java代码如下
class Solution {
public int minPairSum(int[] nums) {
Arrays.sort(nums);
int n = nums.length;
int res = 0;
for(int i = 0;i<n/2;i++) {
res = Math.max(res,nums[i]+nums[n-i-1]);
}
return res;
}
}