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.
在3Sum基础上改改就行
package pack;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.List;
/*
* 求三数和为0,遍历一个数,以它为定点,再转化为2Sum
*/
class Solution {
public int threeSumClosest(int[] nums,