Middle-题目67:16. 3Sum Closest

原创 2016年05月31日 16:37:54

题目原文:
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(nk1),(只是在某博客里看到的,具体证明我也不知道)
Ksum通用算法如下:
(1)排序,复杂度O(nlogn);
(2)外层循环遍历k-2个指针,暴力O(nk2),内层循环中使用two pointers的思想,一个指针i指向头,一个指针j指向尾,计算k个指针对应元素的和,如果大于sum则j–,如果小于sum则i++,这样i和j两个指针合起来扫一遍,故总复杂度O(nk1)
本题因为是找最为接近的,所以维护一个最小误差即可
源码:(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),具体有待继续研读。

版权声明:完整版Leetcode题解请出门左转https://github.com/cmershen1/leetcode/tree/master/docs

相关文章推荐

leetcode.16----------3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...

16. 3Sum Closest LeetCode题解

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...

[LeetCode16]3Sum Closest

3Sum Closest Given an array S of n integers, find three integers in S such that the sum is closest t...
  • sbitswc
  • sbitswc
  • 2014年06月05日 04:51
  • 553

[leetcode: Python]16. 3Sum Closest

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...
  • NXHYD
  • NXHYD
  • 2017年05月18日 16:39
  • 98

LeetCodet题解--16. 3Sum Closest(离给定值最近的三数之和)

链接 LeetCode题目:https://leetcode.com/problems/3sum-closest/ GitHub代码:https://github.com/gatieme...
  • gatieme
  • gatieme
  • 2016年04月04日 16:22
  • 1286

leetcode 16 3Sum Closest

问题https://leetcode.com/problems/3sum-closest/解法class Solution { public: int threeSumClosest(vect...

【leetcode】Array——3Sum Closest(16)

题目: Given an array S of n integers, find three integers in S such that the sum is closest to a gi...

LeetCode 16_3Sum Closest

今天抽了点儿时间,来刷一道。 这是第16题了,这连续几道题的题型都比较类似,都是要求对数组排列组合,然后从中找出符合特定条件的一些组合,这种题算是一种比较大的题型吧,很多题目最终都转化成了这种题目,...
  • cyfcsd
  • cyfcsd
  • 2015年09月24日 21:09
  • 255

[leetcode 16] 3Sum Closest

题目: Given an array S of n integers, find three integers in S such that the sum is closest to a ...

16. 3Sum Closest (python)

Given an array S of n integers, find three integers in S such that the sum is closest to a given num...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Middle-题目67:16. 3Sum Closest
举报原因:
原因补充:

(最多只允许输入30个字)