Advertisement
1877. Minimize Maximum Pair Sum in Array
EasyView on LeetCode
1877.cs
C#
public class Solution
{
public int MinPairSum(int[] nums)
{
int ans = 0;
Array.Sort(nums);
int i = 0, j = nums.Length - 1;
while (i < j)
ans = Math.Max(ans, nums[i++] + nums[j--]);
return ans;
}
}Advertisement