题目原文:
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).
题目大意:
给出一个数组和一个和值S,求三个数使得它们的和与和值S最为接近。
题目分析:
不管是3sum,4sum还是更多的ksum,可以证明算法复杂度的下界是
O(nk−1)
,(只是在某博客里看到的,具体证明我也不知道)
Ksum通用算法如下:
(1)排序,复杂度O(nlogn);
(2)外层循环遍历k-2个指针,暴力
O(nk−2)
,内层循环中使用two pointers的思想,一个指针i指向头,一个指针j指向尾,计算k个指针对应元素的和,如果大于sum则j–,如果小于sum则i++,这样i和j两个指针合起来扫一遍,故总复杂度
O(nk−1)
。
本题因为是找最为接近的,所以维护一个最小误差即可
源码:(language:java)
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的碎碎念:
似乎用HashMap可以把2sum优化到线性,4sum优化到接近
O(n2)
,具体有待继续研读。