#最接近的三数之和

#leetcode题

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums.sort()
        list1=[]
        mins=nums[0]+nums[1]+nums[2]-target
        for i in range(0,len(nums)-2):
            x=i+1
            y=len(nums)-1
            while(x<y):
                 sums=nums[i]+nums[x]+nums[y]-target
                 if sums==0:
                     return target
                 elif sums <0 and x<y:
                     x+=1
                 else :
                     y-=1
                 if abs(sums)<abs(mins):
                     mins=sums
        return mins+target

#通过双指针，依次比较三数之和与目标值差的的绝对值大小，储存最小值。