题目描述:
示例 1:
示例 2:
思路:
代码实现:
class Solution {
public int minPairSum(int[] nums) {
Arrays.sort(nums);
int len = nums.length;
int j = len - 1;
int result = Integer.MIN_VALUE;
for (int i = 0; i < len / 2; i++) {
int sum = nums[i] + nums[j--];
result = Math.max(maxNum, sum);
}
return result;
}
}