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

public class Solution {
    public int threeSumClosest(int[] nums, int target) {
            Arrays.sort(nums);
            int min =nums[0]+nums[1]+nums[2];
            int len = nums.length;
            for (int r=0;r<nums.length-2;r++)
            {
                if(r>0&&nums[r]==nums[r-1]) continue;
                int i = r+1;
                int j = len-1;
                while(i<j)
                {
                    int sum = nums[r]+nums[i]+nums[j];
                    if(Math.abs(sum-target)<Math.abs(min-target))
                    {
                        
                        min = sum;
                        while(i<j&&nums[i]==nums[i+1]) i++;
                        while(i<j&&nums[j]==nums[j-1]) j--;

                    }
                    if(sum==target) min=target;
                    if(sum>target) j--;
                    else i++;

                }
                
            }
            return min;
    }
}