Class Solution
java.lang.Object
g1801_1900.s1877_minimize_maximum_pair_sum_in_array.Solution
1877 - Minimize Maximum Pair Sum in Array.<p>Medium</p>
<p>The <strong>pair sum</strong> of a pair <code>(a,b)</code> is equal to <code>a + b</code>. The <strong>maximum pair sum</strong> is the largest <strong>pair sum</strong> in a list of pairs.</p>
<ul>
<li>For example, if we have pairs <code>(1,5)</code>, <code>(2,3)</code>, and <code>(4,4)</code>, the <strong>maximum pair sum</strong> would be <code>max(1+5, 2+3, 4+4) = max(6, 5, 8) = 8</code>.</li>
</ul>
<p>Given an array <code>nums</code> of <strong>even</strong> length <code>n</code>, pair up the elements of <code>nums</code> into <code>n / 2</code> pairs such that:</p>
<ul>
<li>Each element of <code>nums</code> is in <strong>exactly one</strong> pair, and</li>
<li>The <strong>maximum pair sum</strong> is <strong>minimized</strong>.</li>
</ul>
<p>Return <em>the minimized <strong>maximum pair sum</strong> after optimally pairing up the elements</em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> nums = [3,5,2,3]</p>
<p><strong>Output:</strong> 7</p>
<p><strong>Explanation:</strong> The elements can be paired up into pairs (3,3) and (5,2).</p>
<p>The maximum pair sum is max(3+3, 5+2) = max(6, 7) = 7.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> nums = [3,5,4,2,4,6]</p>
<p><strong>Output:</strong> 8</p>
<p><strong>Explanation:</strong> The elements can be paired up into pairs (3,5), (4,4), and (6,2).</p>
<p>The maximum pair sum is max(3+5, 4+4, 6+2) = max(8, 8, 8) = 8.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>n == nums.length</code></li>
<li><code>2 <= n <= 10<sup>5</sup></code></li>
<li><code>n</code> is <strong>even</strong>.</li>
<li><code>1 <= nums[i] <= 10<sup>5</sup></code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
minPairSum
public int minPairSum(int[] nums)
-