class Solution:
def threeSumClosest(self, nums, target):iflen(nums)<3:return None
nums.sort()
result=nums[0]+nums[1]+nums[-1]for i , num0 in enumerate(nums):
li, ri = i+1,len(nums)-1while(li<ri):
sum3=num0+nums[li]+nums[ri]ifabs(sum3-target)<abs(result-target):
result=sum3
if sum3>target: ri-=1if sum3<target: li+=1if sum3==target:breakreturn result