16.3sum closest

16.3sum closest

import java.lang.Math;
import java.util.*;
class Solution {
    public int threeSumClosest(int[] nums, int target) {
    int clos_sum = nums[0]+nums[1]+nums[2];
    int ini_diff= Math.abs(clos_sum - target);
    Arrays.sort(nums);
    for(int i=0; i<nums.length - 2; i++) {
        int left = i + 1, right = nums.length - 1;
        while(left < right) {
            int newsum = nums[i] + nums[left] + nums[right];
            int new_diff = Math.abs(newsum - target);
            if(new_diff < ini_diff) {
                ini_diff = new_diff;
                clos_sum = newsum;
            }
            if(newsum < target){
                ++left;
            }
            else{
                --right;
            }
        }
        
    }    
    return clos_sum;            
    }
}