1877. 数组中最大数对和的最小值 Posted on 2021-12-02 Edited on 2022-11-27 In leetcode Disqus: Symbols count in article: 271 Reading time ≈ 1 mins. 1877. 数组中最大数对和的最小值 使得他们和起来的波动最小,所以排序后,两头加,大的加小的 12345678910class Solution {public: int minPairSum(vector<int>& nums) { sort(nums.begin(), nums.end()); int ret = 0; for(int i = 0, n = nums.size(); i < n / 2; ++i) // 只需要遍历一半 ret = max(nums[i] + nums[n - i - 1], ret); return ret; }};