16. 3Sum Closest

class Solution 
{
    public int threeSumClosest(int[] nums, int target) 
    {
        Arrays.sort(nums);
        int cl1=+100000,cl2=-100000;
        for(int i=0;i<nums.length;i++)
        {
            int j=i+1;
            int k=nums.length-1;
            while(k>j)
            {
                if(nums[i]+nums[j]+nums[k]>=target )
                {
                    if(cl1>nums[i]+nums[j]+nums[k])
                        cl1=nums[i]+nums[j]+nums[k];
                    k--;
                }
                else if(nums[i]+nums[j]+nums[k]<=target )
                {
                    if(cl2<nums[i]+nums[j]+nums[k])
                        cl2=nums[i]+nums[j]+nums[k];
                    j++;
                }
            }
        }
        if(cl1-target > target-cl2)
            return cl2;
        else
            return cl1;
       // return 1;
    }
}