Leetcode刷题记录——16. 最接近的三数之和

采用的思路是 固定一个数字 + 双指针
a + b + c - target = res的绝对值尽量小
也就是 首先固定一个a，这里遍历即可
然后 对于a后面部分的数组，弄一个头指针和尾指针
然后两个往中间挪 方向取决于如何让res的绝对值更小

class Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        nums = sorted(nums)
        print(nums)
        length = len(nums)
        if length == 3:
            return sum(nums)
        tempres = None
        res = []
        for i in range(length):
            head = nums[i]
            if i > 0 and head == nums[i-1]:
                continue
            elif i == length - 3:
                newlist = nums[i+1:]
                if abs(head + newlist[-2] + newlist[-1] - target) < tempres:
                    res = [head,newlist[-2],newlist[-1]]
                    print(res)
            else:
                print(head)
                newlist = nums[i+1:]
                start = 0
                end = len(newlist) - 1
                while start < end - 1:
                    if tempres == None:
                        tempres = abs(head + newlist[start] + newlist[end] - target)
                        res = [head,newlist[start],newlist[end]]
                    else:
                        if abs(end - start) > 1 and abs(head + newlist[start + 1] + newlist[end] - target) < abs(head + newlist[start] + newlist[end - 1] - target):
                            start += 1
                        elif abs(end - start) > 1 and abs(head + newlist[start + 1] + newlist[end] - target) >= abs(head + newlist[start] + newlist[end - 1] - target):
                            end -= 1
                        if abs(head + newlist[start] + newlist[end] - target) < tempres:
                            tempres = abs(head + newlist[start] + newlist[end] - target)
                            res = [head,newlist[start],newlist[end]]
                            print(res)
        return sum(res)