https://leetcode-cn.com/problems/3sum-closest/ 数组、双指针

双指针

  1. function threeSumClosest(nums: number[], target: number): number {
  2.     nums.sort((a, b) => a - b)
  4.     let min: number = Infinity;
  5.     let res: number = 0;
  6.     let i = 0;
  8.     while(i < nums.length - 2) {
  9.         let l = i + 1;
  10.         let r = nums.length - 1
  11.         while(l < r) {
  12.             let add = nums[i] + nums[l] + nums[r]
  13.             let diff = Math.abs(target - add)
  14.             if (diff < min) {
  15.                 min = diff
  16.                 res = add
  17.             }
  18.             add < target ? l++ : r--
  19.         }
  20.         i++
  21.     }
  23.     return res
  24. };