Two Sum Less Than K · LeetCode Site Generator

Description

null

Solution(javascript)

/**
 * @param {number[]} A
 * @param {number} K
 * @return {number}
 */
const twoSumLessThanK = function (A, K) {
  A.sort((a, b) => a - b)
  let min = -1
  let left = 0
  let right = A.length - 1
  while (left < right) {
    const sum = A[left] + A[right]
    if (sum >= K) {
      right -= 1
    } else {
      left += 1
      min = Math.max(
        min,
        sum,
      )
    }
  }
  return min
}