class Solution:
"""
@param numbers: Give an array numbers of n integer
@param target : An integer
@return : return the sum of the three integers, the sum closest target.
"""
def threeSumClosest(self, numbers, target):
# write your code here
numbers.sort()
ans = None
for i in range(len(numbers)):
l, r = i + 1, len(numbers) - 1
while(l<r):
tmp = numbers[l] + numbers[i] + numbers[r]
if not ans or abs(tmp - target) < abs(ans - target):
ans = tmp
if tmp <= target:
l += 1
else:
r -= 1
return ans
LintCode:最接近的三数之和
最新推荐文章于 2024-03-22 14:25:57 发布