Given an arraySofnintegers, find three integers inSsuch that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.

    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

class Solution {
    public int threeSumClosest(int[] nums, int target) {

        Arrays.sort(nums);
        int closet = Integer.MAX_VALUE;
        int result = 0;
        for(int i = 0 ; i < nums.length-2; i++){
            if(i>0 && nums[i] == nums[i-1] ){
                continue;    
            }
            int left = i+1;
            int right = nums.length-1;
            while(left < right){
                int sum = nums[i] + nums[left] + nums[right];
                int diff = Math.abs(sum - target);
                if(diff<closet){
                    closet = diff;
                    result = sum;
                }
                if(sum < target){
                    left++;
                }else if(sum > target){
                    right--;
                }else  {
                    return target;
                }
            }
        }

        return result;

    }
}