LeetCode016- 最接近的三数之和

给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。

例如，给定数组 nums = [-1，2，1，-4], 和 target = 1.

与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).

思路：与第15题差不多，最接近的就是三数和跟目标值的差的绝对值最小。

执行用时 : 384 ms, 在3Sum Closest的Python3提交中击败了13.93% 的用户

内存消耗 : 12.9 MB, 在3Sum Closest的Python3提交中击败了98.21% 的用户

class Solution:
    def threeSumClosest(self, nums, target):
        nums.sort()  # 先对数组排序
        res = 0
        mindiff = float('inf')
        for i in range(len(nums)):
            #if i>0 and nums[i]==nums[i-1]:
            #    continue
            l = i + 1
            r = len(nums) - 1
            while l < r:
                s = nums[i] + nums[l] + nums[r]
                diff = s-target
                #print(diff)
                if abs(diff) < mindiff:
                    res = (nums[i]+nums[l]+nums[r])
                    mindiff = min(mindiff,abs(diff))
                if s-target == 0:
                    res = (nums[i]+nums[l]+nums[r])
                    break
                elif s-target < 0:
                    l += 1
                else:
                    r -= 1
        return res

s = Solution()
res = s.threeSumClosest([0,2,1,-3],1)
print(res)

执行用时 : 128 ms, 在3Sum Closest的Python3提交中击败了82.54% 的用户

内存消耗 : 13 MB, 在3Sum Closest的Python3提交中击败了93.59% 的用户

class Solution:
    def threeSumClosest(self, nums, target):
        nums.sort()  # 先对数组排序
        res = 0
        mindiff = float('inf')
        for i in range(len(nums)):
            if i>0 and nums[i]==nums[i-1]:
                continue
            l = i + 1
            r = len(nums) - 1
            while l < r:
                s = nums[i] + nums[l] + nums[r]
                diff = s-target
                #print(diff)
                if abs(diff) < mindiff:
                    res = (nums[i]+nums[l]+nums[r])
                    mindiff = min(mindiff,abs(diff))
                if s-target == 0:
                    res = (nums[i]+nums[l]+nums[r])
                elif s-target < 0:
                    l += 1
                else:
                    r -= 1
        return res

s = Solution()
res = s.threeSumClosest([0,1,2],3)
print(res)