leetcode-----16. 最接近的三数之和

• 链接：https://leetcode-cn.com/problems/3sum-closest/

代码

class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int ans = nums[0] + nums[1] + nums[2];
        Arrays.sort(nums);
        int n = nums.length;

        for (int i = 0; i < n; ++i) {
            int l = i + 1, r = n - 1;
            while (l < r) {
                int sum = nums[i] + nums[l] + nums[r];
                if (Math.abs(sum - target) < Math.abs(ans - target)) {
                    ans = sum;
                }
                if (sum == target) {
                    return target;
                } else if (sum < target) l++;
                else r--;
            }
        }
        return ans;
    }
}