leetcode 16. 3Sum Closest

class Solution {
public:
int threeSumClosest(vector<int>& nums, int target)
{
int res = INT_MAX - abs(target);
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size(); i++)
{
int target2 = target - nums[i]; // find two elements of which the sum is closest to target2
int left = i + 1, right = nums.size() - 1;
while (left < right)
{
int SumOfTwo = nums[left] + nums[right];
if (SumOfTwo == target2)
{
return target;
}
else
{
if (abs(SumOfTwo + nums[i] - target) < abs(res - target))
{
res = SumOfTwo + nums[i];
}
if (SumOfTwo < target2)
{
left++;
}
else
{
right--;
}
}
}
while (i + 1 < nums.size() && nums[i + 1] == nums[i])
{
i++;
}
}
return res;
}
};