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

public class Solution {

public int threeSumClosest(int[] nums, int target) {
    Arrays.sort(nums);

    int diff = Integer.MAX_VALUE, closest = 0;

    for (int k=0; k<nums.length-2; ++k) {
        for (int i=k+1, j=nums.length-1; i<j; ) {
            int sum = nums[k] + nums[i] + nums[j];
            if (sum == target) { return target; }
            else if (sum > target) {
                if (sum-target < diff) {
                    diff = sum-target;
                    closest = sum;
                }
                --j;
            } else {
                if (target-sum < diff) {
                    diff = target-sum;
                    closest = sum;
                }
                ++i;
            }
        }
    }
    return closest;
}

}