给定一个包括 n 个整数的数组 nums
和 一个目标值 target
。找出 nums
中的三个整数,使得它们的和与 target
最接近。返回这三个数的和。假定每组输入只存在唯一答案。
例如,给定数组 nums = [-1,2,1,-4], 和 target = 1. 与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).
leetcode 15的变种,搞定了那题这题就照葫芦画瓢了
class Solution(object):
def threeSumClosest(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
nums.sort()
i = 0
closeabs = abs(nums[0] + nums[1] + nums[2] - target)
nsum = nums[0] + nums[1] + nums[2]
while i < len(nums) - 2:
j = i + 1
k = len(nums) - 1
t = target - nums[i]
while k > j:
t2 = abs(t - nums[j] - nums[k])
if t2 < closeabs:
closeabs = t2
nsum = nums[i] + nums[j] + nums[k]
if nums[j] + nums[k] == t:
closeabs = 0
while j < len(nums) - 2 and nums[j] == nums[j+1]:
j += 1
j += 1
while k > j and nums[k] == nums[k-1]:
k -= 1
k -= 1
elif nums[j] + nums[k] < t:
j += 1
elif nums[j] + nums[k] > t:
k -= 1
while i < len(nums) - 1 and nums[i] == nums[i+1]:
i += 1
i += 1
return nsum