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