https://leetcode-cn.com/problems/3sum-closest/

Author: masx200

3sum-closest/index.ts

@@ -0,0 +1,26 @@
+export default function threeSumClosest(
+    nums: number[],
+    target: number
+): number {
+    let N = nums.length;
+    let res = Number.MAX_SAFE_INTEGER;
+    nums.sort((a, b) => a - b);
+    for (let i = 0; i < N; i++) {
+        let left = i + 1;
+        let right = N - 1;
+        while (left < right) {
+            let sum = nums[i] + nums[left] + nums[right];
+            if (Math.abs(sum - target) < Math.abs(res - target)) {
+                res = sum;
+            }
+            if (sum < target) {
+                left++;
+            } else if (sum > target) {
+                right--;
+            } else {
+                return sum;
+            }
+        }
+    }
+    return res;
+}

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode-cn.com/problems/3sum-closest/
+
 https://leetcode.cn/problems/three-equal-parts/
 
 https://leetcode.cn/problems/number-of-pairs-satisfying-inequality/