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

分析：
数组，找到一组三个数，他们的和与目标值相差最小。
显然，这是3Sum的变异。要求返回的是满足条件的三个数的和，而且， 有且只有一个解。

思路：
排序，两个指针，遍历。每次求得的结果跟目标值比较，记录下，当前的最小值。

代码:

#include <limits>   //INT_MAX
#include<stdlib.h>  //abs()函数，用于求绝对值
class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int result, front,back, sum, diff,min = INT_MAX ;
        int len = nums.size();
        sort(nums.begin(), nums.end());
        for(int i =0; i<len; i++)
        {
            front = i + 1;
            back = len -1;
            while(front < back)
            {
                sum = nums[i] + nums[front] + nums[back];
                diff = abs(target - sum);
                if(diff < min)
                {
                    result = sum;
                    min = diff;
                    if(diff == 0) return result;
                }
                if( sum > target) back --;
                if(sum < target) front ++;
            }
        }
        return result;
    }
};