package code;
import java.util.Arrays;
/*
* 16. 3Sum Closest
* 题æ„：找出3个数的和最接近target
* 难度：Medium
* 分类：Array, Two Pointers
* æ€è·¯ï¼š3sumçš„æ€è·¯ï¼Œæ¯æ¬¡è®°ä¸‹æœ€æŽ¥è¿‘çš„reså³å¯
* Tips：lc15, lc16, lc923
*/
public class lc16 {
public int threeSumClosest(int[] nums, int target) {
int res = nums[0]+nums[1]+nums[2];
Arrays.sort(nums);
for (int i = 0; i < nums.length-2 ; i++) {
int start = i+1;
int end = nums.length-1;
while(start