leetcode16 3Sum Closest

"""
Given an array nums of n integers and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
Example:
Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
"""
"""
双指针法
"""
class Solution1:
    def threeSumClosest(self, nums, target):
        nums.sort()
        res = nums[0] + nums[1] + nums[2]
        for i in range(len(nums)-2):
            # bug 有了下面这个 对于[0,0,0] 过不去
            # if nums[i] == [i+1]:
            #     continue
            j = i + 1
            k = len(nums)-1
            while j < k:
                n = nums[i] + nums[j] + nums[k]
                if n == target:
                    return n
                if abs(n - target) < abs(res - target):
                    res = n
                if n > target:  #！！！终止条件,写的时候没有考虑到
                    k -= 1
                elif n < target:
                    j += 1
        return res


"""
自己的想法暴力解法，三层循环
超时
"""
class Solution2:
    def threeSumClosest(self, nums, target):
        temp = float('inf')
        for i in range(len(nums)):
            j = i + 1
            for j in range(j, len(nums)):
                k = j + 1
                for k in range(k, len(nums)):
                    n = nums[i] + nums[j] +nums[k]
                    if abs(n-target) < temp:
                        temp = abs(n-target)
                        res = n
        return res