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

26 lines
309 B
Go

package q1679
import "slices"
func maxOperations(nums []int, k int) int {
slices.Sort(nums)
nOps := 0
l, r := 0, len(nums)-1
for l < r {
sum := nums[l] + nums[r]
switch {
case sum == k:
nOps++
l++
r--
case sum > k:
r--
default:
l++
}
}
return nOps
}
var _ = maxOperations