16. 3Sum Closest(java)

public class Solution{

    public static int  threeSumClosest(int[] nums, int target) {

        int j = 0, k = 0, minTotarget = 10000000,key=0;
        Arrays.sort(nums);

        for (int i = 0; i < nums.length; i++) {

            while (i > 0 && i < nums.length && nums[i] == nums[i - 1]) {
                i++;
            }
            j = i + 1;
            k = nums.length - 1;

            while (j < k) {
                int sum = nums[j] + nums[i] + nums[k];
                if (sum < target) {
                    if (Math.abs(sum - target) < minTotarget) {
                        minTotarget = Math.abs(sum - target);
                        key=sum;
                    }
                    j++;
                    while (j < k && nums[j] == nums[j - 1]) {
                        j++;
                    }


                } else if (sum > target) {
                    if (Math.abs(sum - target) < minTotarget)
                    {
                        minTotarget = Math.abs(sum - target);
                        key=sum;
                    }

                    k--;
                    while (k > j && nums[k] == nums[k + 1])
                        k--;
                } else {
                    minTotarget = 0;
                    key=target;
                    break;
                }
            }
        }
        return key;
    }
}