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(vector<int>& nums, int target) {
          sort(nums.begin(),nums.end());
          int min = nums[0]+nums[1]+nums[2];
          for(int i = 0;i < nums.size();i++)//仍为三数和问题
          {
               int start = i+1;
               int end = nums.size()-1;
               while(start<end)
               {
                   int sum = nums[start]+nums[end]+nums[i];
                   if(abs(sum-target)<abs(min-target))//维护一个最小值
                        min = sum;
                    if(sum>target)
                    {
                        end--;
                    }else if(sum<target){

                        start++;
                    }else{
                        return min;
                    }
               }
          }
          return min;
    }
};