Leetcode 3SumClosest

16、3SumClosest

问题描述：

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.

    For example, given array S = {-1 2 1 -4}, and target = 1.
    The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

分析：

给定一个数列s和一个整数target,求三个数的和与target的差是否为最小,并输出和值。
要保证当前三数和跟给定值之间的差的绝对值最小，所以需要定义一个变量用来记录差的绝对值，然后还是要先将数组排个序，然后开始遍历数组，思路跟那道3sum很相似，采用左右夹逼的方法寻找另外两个数，求出此三数之和，然后算和给定值的差的绝对值存在新变量中，然后和之前变量进行比较更新差的绝对值和三数之和。比较复杂度O（n^2）.

C++实现：

class Solution{
public:
    int threeSumClosest(vector<int> & nums, int target){
        int result = 0;
        int min_gap = INT_MAX;

        sort(nums.begin(), nums.end());
        for (auto a = nums.begin(); a != prev(nums.end(), 2); ++a){
            auto b = next(a);
            auto c = prev(nums.end());
            while (b < c){
                 const int  sum = *a + *b + *c;
                 const int gap = abs(sum - target);
                if (gap < min_gap){
                    result = sum;
                    min_gap = gap;
                }
                if (sum < target)
                    ++b;
                else
                    --c;
            }
        }
        return result;
    }
};

知识点：
（1）INT_MAX：在C/C++的在limits.h/climits中，定义了INT_MAX,INT_MIN，可以直接使用得到int型能表示的最大值；
（2）abs()函数：绝对值函数；

python实现：

class Solution(object):
    def threeSumClosest(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        nums.sort()
        ans = 0
        diff = float("inf")
        for i in xrange(0, len(nums)):
            start, end = i + 1, len(nums) - 1
            while start < end:
                sum = nums[i] + nums[start] + nums[end]
                if sum > target:
                    if abs(target - sum) < diff:
                        diff = abs(target - sum)
                        ans = sum
                    end -= 1
                else:
                    if abs(target - sum) < diff:
                        diff = abs(target - sum)
                        ans = sum
                    start += 1
        return ans

知识点：float(“inf”):表示python中的正无穷；