LeetCode/JavaScript/3sum-closest.js at main · PranamBhat/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
/**
 * @param {number[]} nums
 * @param {number} target
 * @return {number}
 */
var threeSumClosest = function(nums, target) {

    var len = nums.length;
    var res = nums[0] + nums[1] + nums[2];
    var sum = 0;
    var l = 0;
    var r = 0;
    nums.sort((a, b) => (a - b));
    for (var i = 0; i < len - 2; i++) {
        if (i > 0 && nums[i] === nums[i - 1]) continue;
        l = i + 1;
        r = len - 1;
        while (l < r) {
            sum = nums[i] + nums[l] + nums[r];
            if (sum < target) {
                l++;
            } else if (sum > target) {
                r--;
            } else {
                return sum;
            }
            if (Math.abs(sum - target) < Math.abs(res - target)) res = sum;
        }
    }
    return res;
};