leetcode - 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

class Solution {
public:
    int threeSumClosest(std::vector<int> &num, int target) {
		int sz = num.size();
		std::sort(num.begin(),num.end());
		int res = num[0] + num[1] + num[2] - target;
		for (int i = 0; i < sz; i++)
		{
			int begin = i + 1;
			int end = sz - 1;
			while(begin < end)
			{
				int sum = num[i] + num[begin] + num[end] - target;
				if(sum == 0) return target;
				if(std::abs(sum) < std::abs(res)) res = sum;
				if(sum < 0) begin++;
				else end--;
			}
		}
		return res + target;
    }
};