# Middle-题目67：16. 3Sum Closest

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.
For example, given array S = {-1 2 1 -4}, and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Ksum通用算法如下：
（1）排序，复杂度O(nlogn);
（2）外层循环遍历k-2个指针，暴力O(nk2)$O(n^{k-2})$，内层循环中使用two pointers的思想，一个指针i指向头，一个指针j指向尾，计算k个指针对应元素的和，如果大于sum则j–,如果小于sum则i++，这样i和j两个指针合起来扫一遍，故总复杂度O(nk1)$O(n^{k-1})$

public class Solution {
public static int threeSumClosest(int[] nums, int target) {
Arrays.sort(nums);
int min = 9999999;
int length = nums.length-1;
for(int middle = 0;middle < length; middle++) {
int i = 0,j = length, error = 9999999;
while(i<middle && j>middle) {
error = nums[i] + nums[middle] + nums[j] - target;
if(error == 0)
return target;
else if (error > 0)
j--;
else
i++;
min=Math.abs(error)<Math.abs(min)?error:min;
}

}
return target+min;
}
}

15ms ,beats 35.55%,众数14ms,12.16%
Cmershen的碎碎念：

• 本文已收录于以下专栏：

举报原因： 您举报文章：Middle-题目67：16. 3Sum Closest 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)