0016. 3Sum Closest

class Solution {
    public static int threeSumClosest(int[] nums, int target) {
        int sum = nums[0] + nums[1] + nums[2];
        int diff = Integer.MAX_VALUE;
        Arrays.sort(nums);
        for(int i = 0; i <= nums.length - 3; i++){
            int l = i + 1;
            int r = nums.length - 1;
            while(l < r){
                int newSum = nums[i] + nums[l] + nums[r];
                if(newSum == target) return target;
                else if(newSum < target) l++;
                else r--;
                int newDiff = Math.abs(newSum - target);
                if(newDiff < diff){
                    diff = newDiff;
                    sum = newSum;
                }
            }
        }
        return sum;
    }
}