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).

Solution:

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
        int left,right,i,closest = nums[0]+nums[1]+nums[2];
        Arrays.sort(nums);
        for(i=0; i<nums.length-2; i++){
            left = i + 1; right = nums.length-1; 
            while(left<right){
                closest = (Math.abs(closest - target) < Math.abs(nums[i]+nums[left]+nums[right]-target) ? closest:nums[i]+nums[left]+nums[right]);
                if((nums[i]+nums[left]+nums[right])>target) right--;
                else left++;
            }

            if (closest == target) return closest;
            if (i<nums.length-2 && nums[i] == nums[i+1]) i++;
        }

        return closest;
    }
}