最接近target的三数之和

题目

题源

代码

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        Arrays.sort(nums);
        int n = nums.length;
        // int best = Integer.MAX_VALUE;
        int best = 100000;
        for (int i = 0; i < n; i++) {
            if (i > 0 && nums[i] == nums[i - 1]) {
                continue;
            }
            int a = i + 1, b = n - 1; 
            while (a < b) {
                int sum = nums[i] + nums[a] + nums[b];
                if (sum == target) {
                    return target;
                }
                if (Math.abs(sum - target) < Math.abs(best - target)) {
                    best = sum;
                }
                if (sum < target) {
                    int a0 = a + 1;
                    while (a0 < b && nums[a0] == nums[a]) {
                        a0++;
                    }
                    a = a0;
                } else {
                    int b0 = b - 1;
                    while (b0 > a && nums[b0] == nums[b]) {
                        b0--;
                    }
                    b = b0;
                }
            }

        }
        return best;
    }
}