Leetcode每日一题_16
public int threeSumClosest(int[] nums, int target) {
     int res=nums[0]+nums[1]+nums[nums.length-1];
Arrays.sort(nums);
for&nbsp;(int&nbsp;i&nbsp;=&nbsp;0;&nbsp;i&nbsp;<&nbsp;nums.length-2;&nbsp;i++)&nbsp;{
int&nbsp;start=i+1,end=nums.length-1;
while&nbsp;(start<end)&nbsp;{
int&nbsp;sum=nums[i]+nums[start]+nums[end];
if&nbsp;(Math.abs(sum-target)<Math.abs(res-target))&nbsp;{
res=sum;
}
if&nbsp;(sum>target)&nbsp;{
end--;
}else&nbsp;if&nbsp;(sum<target)&nbsp;{
start++;

}else&nbsp;{
return&nbsp;res;
}
}
}
return&nbsp;res;
&nbsp;&nbsp;&nbsp;&nbsp;}