LeetCode16 最接近的三数之和

题目

解题：排序 + 双指针

思路参考：最接近的三数之和。

// javascript
var threeSumClosest = function(nums, target) {
    const n = nums.length;
    nums.sort((a, b) => a - b);
    let best = Number.MAX_VALUE;
    for (let i = 0; i < n - 2; ++i) {
        let j = i + 1, k = n - 1;
        while (j < k) {
            const sum = nums[i] + nums[j] + nums[k];
            if (sum === target) return target;
            if (Math.abs(sum - target) < Math.abs(best - target)) best = sum;
            if (sum > target) k--;
            else j++;
        }
    }
    return best;
};

优化：

// javascript
var threeSumClosest = function(nums, target) {
    const n = nums.length;
    nums.sort((a, b) => a - b);
    let best = Number.MAX_VALUE;
    for (let i = 0; i < n - 2; ++i) {
        if (i > 0 && nums[i] === nums[i - 1]) continue;       // 不重复枚举 a
        let j = i + 1, k = n - 1;
        while (j < k) {
            const sum = nums[i] + nums[j] + nums[k];
            if (sum === target) return target;
            if (Math.abs(sum - target) < Math.abs(best - target)) best = sum;
            if (sum > target) {
                let k0 = k - 1;
                while (j < k0 && nums[k0] === nums[k]) k0--;  // 不重复枚举 b
                k = k0;
            }
            else {
                let j0 = j + 1;
                while (j0 < k && nums[j0] === nums[j]) j0++;  // 不重复枚举 c
                j = j0;
            }
        }
    }
    return best;
};