class Solution {
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int sum=nums[0]+nums[1]+nums[2];
for(int i=0;i<nums.length-2;i++){
int j=i+1,k=nums.length-1;
while(j<k){
int temp=nums[i]+nums[j]+nums[k];
if(temp==target){
return target;
}else if(temp>target){
k--;
if(Math.abs(temp-target)<Math.abs(sum-target))
sum=temp;
}else{
j++;
if(Math.abs(temp-target)<Math.abs(sum-target))
sum=temp;
}
}
}
return sum;
}
}