leetcode 16. 3Sum Closest

最新推荐文章于 2020-10-13 04:19:10 发布

明明是我先的

最新推荐文章于 2020-10-13 04:19:10 发布

阅读量142

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/zhuanli555/article/details/80759768

leetcode 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一个算法问题：给定一个整数数组和一个目标值，找到数组中三个整数相加最接近目标值的和。通过排序和双指针技术实现了高效的求解方法。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution(object):
    def threeSumClosest(self,nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        min_target = float("inf")
        for i in range(len(nums)-2):
            l,r = i + 1,len(nums)-1
            while l < r:
                if nums[i] + nums[l] + nums[r] - target == 0:
                    return target
                if abs(nums[i] + nums[l] + nums[r] - target) <= abs(min_target - target):
                    min_target = nums[i] + nums[l] + nums[r]
                if nums[i] + nums[l] + nums[r] > target:
                    r -= 1
                elif nums[i] + nums[l] + nums[r] < target:
                    l += 1

        return min_target