class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(),nums.end());
int min=target-(nums[0]+nums[1]+nums[2]);
for(int i=0;i<nums.size();i++){
for(int j=i+1,k=nums.size()-1;j<k;){
if(Math.abs(min)>Math.abs(target-(nums[i]+nums[j]+nums[k])){
min=target-(nums[i]+nums[j]+nums[k]);
}
if(numsnums[i]+nums[j]+nums[k]>target){
k--;
}else if(nums[i]+nums[j]+nums[k]<target){
j++;
}else{
return target;
}
}
}
return min;
}
};
