16. 3Sum Closest【M】【14】

原创 2016年05月31日 15:56:50

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).


Subscribe to see which companies asked this question


跟前一道题还是很像的。

下面的还是用变态方法做的

class Solution(object):
    def threeSumClosest(self, nums, target):

        nums.sort()
        #print nums
        res = 0
        minn = 1 << 31
        l = len(nums)

        for i in xrange(l):
            a = 0
            b = l - 1 #en(nums) - 1

            while a < i and b > i:
                #print i,a,b,nums[a],nums[i],nums[b]
                s = nums[a] + nums[b] + nums[i]
                tmp = abs(s - target)
                if minn > tmp:
                    minn = tmp
                    res = s
                if s > target:
                    b -= 1
                else:
                    a += 1
        return res

        '''
        nums.sort()
        #print nums
        minn = 1 << 31
        #print minn
        res = 0

        per = itertools.combinations(nums,3)
        for i in per:
            #print i
            summ = sum(i)#i[0] + i[1] + i[2]
            t = abs(summ - target)
            if t < minn:
                minn = t#abs(summ - target)
                res = summ

        #for i in xrange(len(nums)):
        #    print nums[i]

        return res
        '''

        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """


相关文章推荐

《LeetBook》leetcode题解(16):3Sum Closest [M]

16. 3Sum Closest [M]Given an array S of n integers, find three integers in S such that the sum is cl...

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
  • 556

[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
  • 99

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

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

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
  • 260

[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【M】【14】
举报原因:
原因补充:

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