Minimize Maximum Pair Sum in Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minPairSum(vector<int> &nums) {
4
    // sort the array
5
    sort(nums.begin(), nums.end());
6
    int start = 0, end = nums.size() - 1, min_max_pair_sum = 0;
7
    // Observe the pattern of taking the first and last element, second and
8
    // second last element... and soo onn.. would help you to minimize the
9
    // maximum sum.
10
    while (start < end) {
11
      min_max_pair_sum = max(min_max_pair_sum, nums[start++] + nums[end--]);
12
    }
13
    return min_max_pair_sum;
14
  }
15
};