int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int i = 0, j = nums.size() - 1, k = 1;
int Min = INT_MAX;
int approx;
while (i < j) {
k = i + 1;
j = nums.size() - 1;
while (k < j)
{
int sum = nums[i] + nums[j] + nums[k];
if (sum - target == 0)
return sum;
if (sum > target)
j--;
else
k++;
if (abs(sum - target) < Min)
{
Min = abs(sum - target);
approx = sum;
}
}
i++;
}
return approx;