16. 3Sum Closest

16. 3Sum Closest

class Solution {
    public int threeSumClosest(int[] nums, int target) {
    Arrays.sort(nums);
    int result=0,minDiff=Integer.MAX_VALUE;
    for(int i=0;i<nums.length;i++){
      if(i>0&&nums[i-1]==nums[i]){
        continue;
      }
      int start=i+1,end=nums.length-1;
      while (start<end){
        int sum=nums[i]+nums[start]+nums[end];
        if(Math.abs(sum-target)<minDiff){
          minDiff=Math.abs(sum-target);
          result=sum;
        }else if(sum-target<0){
          while (start<end&&nums[start]==nums[start+1]){
            start++;
          }
          start++;
        }else{
          while (start<end&&nums[end]==nums[end-1]){
            end--;
          }
          end--;
        }
      }
    }
    return result;
  }
}