classSolution{publicintthreeSumClosest(int[] nums,int target){
Arrays.sort(nums);int result = nums[0]+nums[1]+nums[nums.length-1];for(int i =0; i < nums.length-2; i++){if(i-1>=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];if(sum == target){return target;}elseif(sum<target){if(Math.abs(sum-target)<Math.abs(result-target)) result = sum;
left++;}else{if(Math.abs(sum-target)<Math.abs(result-target)) result = sum; right--;}}}return result;}}