LeetCode16 最接近的三数之和

 代码

class Solution:
 def threeSumClosest(self, nums: List[int], target: int) - int:
 n len(nums)
 if n 3:
 return None
 nums.sort()
 max_num float( inf )
 for id in range(n):
 if id 0 and nums[id] nums[id-1]:
 continue
 left id 1
 right n - 1
 while left right:
 tar nums[left] nums[right] nums[id]
 if tar target:
 return tar
 elif tar target:
 left 1
 else:
 right - 1
 if abs(target-max_num) abs(target-tar):
 max_num tar
 return max_num