//一次AC 有点爽的
class Solution {

public:

    int threeSumClosest(vector<int>& nums, int target) {

        int res = ;

        int minal = INT_MAX;

        sort(nums.begin(),nums.end());

        for(int i=;i < nums.size()-;i++){

            int cnt = target-nums[i];

            for(int j=i+,k=nums.size()-;j < k;){

                int sum = nums[j]+nums[k];

                if(sum < cnt){j++;}

                else if(sum > cnt){k--;}

                else{

                    res = target;

                    return res;

                }

                if(minal > abs(sum-cnt)){minal = abs(sum-cnt);res = sum+nums[i];}

            }

        }

        return res;

    }

};