17 lines
332 B
Go
17 lines
332 B
Go
// Package q1877 implements a solution for https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/
|
|
package q1877
|
|
|
|
import "slices"
|
|
|
|
func minPairSum(nums []int) int {
|
|
slices.Sort(nums)
|
|
n := len(nums)
|
|
|
|
maxSum := 0
|
|
for i := range n / 2 {
|
|
maxSum = max(maxSum, nums[i]+nums[n-1-i])
|
|
}
|
|
return maxSum
|
|
}
|
|
|
|
var _ = minPairSum
|