0016-3sum-closest.cpp

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int n = nums.size();
        sort(nums.begin(), nums.end());

        int res = 0;
        int minDiff = INT_MAX;

        for (int i = 0; i < n - 2; i++) {
            int j = i + 1;
            int k = n - 1;

            while (j < k) {
                int sum = nums[i] + nums[j] + nums[k];
                if (abs(target - sum) < minDiff) {
                    minDiff = abs(target - sum);
                    res = sum;
                }
                if (sum > target)
                    k--;
                else
                    j++;
            }
        }

        return res;
    }
};