|
| 1 | +/* |
| 2 | +Minimize Maximum Pair Sum in Array |
| 3 | +https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/description/ |
| 4 | +
|
| 5 | +The pair sum of a pair (a,b) is equal to a + b. The maximum pair sum is the largest pair sum in a list of pairs. |
| 6 | +
|
| 7 | +For example, if we have pairs (1,5), (2,3), and (4,4), the maximum pair sum would be max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8. |
| 8 | +Given an array nums of even length n, pair up the elements of nums into n / 2 pairs such that: |
| 9 | +
|
| 10 | +Each element of nums is in exactly one pair, and |
| 11 | +The maximum pair sum is minimized. |
| 12 | +Return the minimized maximum pair sum after optimally pairing up the elements. |
| 13 | +
|
| 14 | +
|
| 15 | +
|
| 16 | +Example 1: |
| 17 | +
|
| 18 | +Input: nums = [3,5,2,3] |
| 19 | +Output: 7 |
| 20 | +Explanation: The elements can be paired up into pairs (3,3) and (5,2). |
| 21 | +The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7. |
| 22 | +
|
| 23 | +
|
| 24 | +Example 2: |
| 25 | +
|
| 26 | +Input: nums = [3,5,4,2,4,6] |
| 27 | +Output: 8 |
| 28 | +Explanation: The elements can be paired up into pairs (3,5), (4,4), and (6,2). |
| 29 | +The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8. |
| 30 | +*/ |
| 31 | + |
| 32 | +/** |
| 33 | + * @param {number[]} nums |
| 34 | + * @return {number} |
| 35 | + */ |
| 36 | + var minPairSum = function(nums) { |
| 37 | + nums.sort((a, b) => a-b); |
| 38 | + let i = 0, j = nums.length - 1; |
| 39 | + let max = -Infinity; |
| 40 | + while (i < j) { |
| 41 | + max = Math.max(max, nums[i++] + nums[j--]); |
| 42 | + } |
| 43 | + return max; |
| 44 | +}; |
| 45 | + |
| 46 | +module.exports.minPairSum = minPairSum; |
0 commit comments