public static int threeSumClosest(int[] nums, int target) {	
	     Arrays.sort(nums);
	     int value=nums[0]+nums[1]+nums[2];
		 for(int i=0;i<nums.length-2;i++)
		 {	 
			int left=i+1;int right=nums.length-1;
			
			while (left<right) {
				int sum=nums[left]+nums[i]+nums[right];
				int gap1=Math.abs(value-target);
				int gap2=Math.abs(sum-target);
				 if(target>=0&&nums[left]+nums[i]-target>gap1)break;
				if(gap2<gap1)
				{
					value=sum;
				} 
			    if (sum==target) {
					return target;
				}
				else if(sum>target) {
					right--;
				}
			    else {
					left++;
				}  
			}
	    }
		 return value;
	 }