LeetCode: 3 Sum 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(vector<int> &num, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
		int i = 0, j = i + 1, l = num.size() - 1;
		int tmp = 0, difference = INT_MAX, result = 0;
		sort(num.begin(), num.end());
		for(i = 0; i < num.size() - 2; i++)
		{
			int a = num[i];
			for(j = i + 1, l = num.size() - 1; j < l; )
			{
				int b = num[j];
				int c = num[l];
				if(a + b + c < target)
				{
					tmp = target - a - b - c;
					if(tmp < difference)
					{
						difference = tmp;
						result = a + b + c;
					}
					j++;
				}
				else if(a + b + c > target)
				{
					tmp = a + b + c - target;
					if(tmp < difference)
					{
						difference = tmp;
						result = a + b + c;
					}
					l--;
				}
				else
				{
					return a + b + c;
				}
			}
		}
		return result;
        
    }
};
Round 2:
<pre name="code" class="cpp">class Solution {
public:
    int threeSumClosest(vector<int> &num, int target) {
        std::sort(num.begin(), num.end());
        int result = 0;
        int closest = INT_MAX;
        for(int i = 0; i < num.size()-2; i++)
        {
            int l = i+1, r = num.size()-1;
            while(l < r)
            {
                if(std::abs(num[i] + num[l] + num[r] - target) < closest)
                {
                    closest = std::abs(num[i] + num[l] + num[r] - target);
                    result = num[i] + num[l] + num[r];
                }
                if(num[i] + num[l] + num[r] > target)
                    r--;
                else if(num[i] + num[l] + num[r] < target)
                    l++;
                else
                    return target;
            }
        }
        return result;
    }
};