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).

int threeSumClosest(vector<int> &num, int target) {
  int result = 0;
  if(num.size() <= 2)
   return result;

  int mindiff  = INT_MAX;
  sort(num.begin(), num.end());
  
  int i = 0;
  
  while(i < num.size())
  {
   int j = i +1 ;
   int k = num.size() - 1;
   while(j < k )
   {
    int x = num[i] + num[j] + num[k];

    if(abs(x  - target) < mindiff)
    {
     mindiff = abs(x - target);
     result = x;
    }

    if(x == target)
               return x;
    else if(x  > target)
     k--;
    else
     j++;
       }

    i++;
  }

 
  return result;
}