[leetcode]16. 3Sum Closest

class Solution {public:    int threeSumClosest(vector<int>& nums, int target)    {        int sum;        int ret;        int close=65535;                sort(nums.begin(),nums.end());                for(int i=0;i<nums.size();i++)//注意这里不用排重，例如【1,1,1,1】return 3        {            int j=i+1;            int k=nums.size()-1;                            while(j<k)            {                sum=nums[i]+nums[j]+nums[k];                if(abs(sum-target)<close)                {                    close=abs(sum-target);                    ret=sum;                }                if(sum==target)                {                    return sum;                }                else if(sum<target)                {                    j++;                }                else                {                    k--;                }            }        }        return ret;    }};