lc-go/solutions/18/q1877/solution.go
2026-01-25 11:56:12 +09:00

16 lines
223 B
Go

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