Leetcode 3Sum Closest

Given an array S of n integers, find three integers in S such 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).

Difficulty: Medium

public class Solution {
public int twoSumClosest(int[] nums, int index, int target){
int sum = nums[index] + nums[nums.length - 1];
int left = index;
int right = nums.length - 1;
while(right > left){
if(nums[right] + nums[left] - target > 0){
sum = Math.abs(nums[right] + nums[left] - target) > Math.abs(sum - target) ? sum : nums[right] + nums[left];
right--;
}
else if(nums[right] + nums[left] - target < 0){
sum = Math.abs(nums[right] + nums[left] - target) > Math.abs(sum - target) ? sum : nums[right] + nums[left];
left++;

}
else{
return target;
}
}
return sum;
}
public int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int sum = nums[0] + nums[1] + nums[2];
for(int i = 0; i < nums.length - 2; i++){
int temp = twoSumClosest(nums, i + 1, target - nums[i]);
sum = Math.abs(temp + nums[i] - target) > Math.abs(sum - target) ? sum : temp + nums[i];
}
return sum;
}
}