t9

题目：

Share

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 Solution:
    def threeSumClosest(self, nums: List[int], target: int) -> int:
        closestTemp = float('inf')
        nums.sort()
        
        for p_i in range(len(nums)-2):
            if(p_i > 0 and nums[p_i] == nums[p_i-1]):
                continue
            p_r = len(nums) -1
            p_l = p_i + 1
            while(p_l < p_r):
                three_sum = nums[p_i] + nums[p_l] + nums[p_r]
                if(abs(target - three_sum) < abs(target-closestTemp)):
                        closestTemp = three_sum
                        #print("new: ", closestTemp)
                if(three_sum == target):
                    return three_sum
                elif(three_sum < target):
                    p_l+=1
                    while(p_l < p_r and nums[p_l] == nums[p_l-1]):
                        p_l+=1
                elif(three_sum > target):
                    p_r-=1
                    while(p_l < p_r and nums[p_r] == nums[p_r+1]):
                        p_r-=1
                    
        return closestTemp