描述
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).
和上一题3Sum基本设定一样,不过这次要求找到与target
最相近的三数之和。返回和的值即可,不需要给出所有组合。
分析
沿用3Sum的解法,用一个变量维护当前最小绝对差值即可。时间复杂度O(n^2)
,空间复杂度O(1)
。
代码
Python
1 | class Solution: |