[LeetCode] 16.最接近的三数之和 最优解@Python

题目

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).

粗略解法

• 参考三数之和可以首先得到一个粗略解法
• 同样是先对nums排序，只不过：
  • 处理的是和为target而非0的三数和问题
  • 对于每次相加得到的total，需要进行一个最接近判断

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()