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的碎碎念：

LeetCode 16 3Sum Closest(C,C++,Java,Python)

2015-05-09 22:26:02

Leetcode #16 3Sum Closest 找3数之和最接近 解题小节

2016-03-19 10:13:59

【LeetCode】LeetCode——第16题：3Sum Closest

2016-04-29 21:18:52

leetcode-java-16. 3Sum Closest

2016-06-07 21:47:12

16. 3Sum Closest Leetcode Python

2015-01-17 10:10:08

【LeetCode】3Sum Closest 解题报告

2014-10-30 16:57:05

15. 3Sum，16. 3Sum Closest，18. 4Sum（最后一个方法重要）重要

2017-02-28 18:38:27

3Sum Closest -- LeetCode

2014-02-22 23:22:01

[LeetCode] 016. 3Sum Closest (Medium) (C++/Java/Python)

2015-03-03 19:10:29

LeetCode-16-3Sum Closest(C语言实现)

2018-01-01 23:04:40

不良信息举报

Middle-题目67：16. 3Sum Closest