[16] 最接近的三数之和

/*
 * @lc app=leetcode.cn id=16 lang=javascript
 *
 * [16] 最接近的三数之和
 */

// @lc code=start
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var threeSumClosest = function (nums, target) {
  if (nums.length === 3) return nums[0] + nums[1] + nums[2];
  nums.sort((a, b) => a - b);
  var result = Infinity;
  for (var i = 0; i < nums.length - 2; i++) {
    var j = i + 1;
    var k = nums.length - 1;

    while (j < k) {
      var num = nums[i] + nums[j] + nums[k];
      if (Math.abs(target - result) > Math.abs(target - num)) result = num;
      if (target > num) {
        j++;
      } else {
        k--;
      }
    }
  }

  return result;
};
// @lc code=end