leetcode 16. 最接近的三数之和

给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数，使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。

例如，给定数组 nums = [-1，2，1，-4], 和 target = 1.

与 target 最接近的三个数的和为 2. (-1 + 2 + 1 = 2).

与leetcode15题相似，要返回它们的和与 target 最接近，即保证当前三数和跟给定值之间的差的绝对值最小，我们可以定义一个变量diff来记录差的绝对值，然后还是先将数组排序，遍历数组，先确定一个数，用两个指针 left 和 right 来滑动寻找另外两个数，每确定两个数，求出此三数之和，然后算和给定值的差的绝对值存在 newdiff 中，然后和 diff 比较并更新 diff 和结果 closest。
时间复杂度O(n^2)，空间复杂度O(1)。
C++

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int closest = nums[0] + nums[1] + nums[2];
        int diff = abs(closest - target);
        sort(nums.begin(), nums.end());
        for (int i = 0; i < nums.size() - 2; ++i)
        {
            int left = i + 1, right = nums.size() - 1;
            while(left < right){
                int sum = nums[i] + nums[left] + nums[right];
                int newdiff = abs(sum - target);
                if (newdiff < diff){
                    diff = newdiff;
                    closest = sum;
                }
                if (sum < target) ++left;
                else --right;
            }
        }
        return closest;
    }
};

Python

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        n = len(nums)
        closet = nums[0] + nums[1] + nums[2]
        diff = abs(closet - target)
        nums.sort()
        for i in range(n-2):
            left, right = i+1, n-1
            while(left < right):
                sum1 = nums[i] + nums[left] + nums[right]
                newdiff = abs(sum1 - target)
                if(newdiff < diff):
                    diff = newdiff
                    closet = sum1
                if(sum1 < target):
                    left = left + 1
                else:
                    right = right - 1
        return closet