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 int threeSumClosest(int[] nums, int target) {        Arrays.sort(nums);        int temp = Integer.MAX_VALUE;        int last = 0;        for(int i = 0; i < nums.length - 2; i++){            int j = i + 1;            int k = nums.length - 1;            while (j < k){                if(nums[i] + nums[j] + nums[k]  == target){                    return target;                }else if(nums[i] + nums[j] + nums[k]  < target){                    int three = nums[j] + nums[k] + nums[i];                    int gap = Math.abs(three - target);                    if(gap < temp){                        temp = gap;                        last = nums[j] + nums[k] + nums[i];                    }                    j++;                }else{                    int three = nums[j] + nums[k] + nums[i];                    int gap = Math.abs(three - target);                    if(gap < temp){                        temp = gap;                        last = nums[j] + nums[k] + nums[i];                    }                    k--;                }            }        }        return last;    }