16. 3Sum Closest

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

题意：找到数组中一个三元组，使该三元组的和最接近目标值。

思路：直接暴力求解的话时间复杂度是o(n^3)，采取优化一些的思路可以达到o(n^2)。

           第一步是排序。想到了以前老师说过的，数组问题的优化先进行排序。

           然后固定住第一个数，后两个数采用夹逼的思路，从两端求取。

class Solution {
public:
	int threeSumClosest(vector<int>& nums, int target) {
		if (nums.size() < 0)
			return 0;
		sort(nums.begin(), nums.end());
		int sum;
		int distance = (numeric_limits<int>::max)();
		int i, j, k;
		for (int i = 0; i < nums.size()-2; i++){
			if (i>0 && nums[i] == nums[i - 1])
				continue;
			j = i + 1;
			k = nums.size() - 1;
			while (j < k){
				sum = nums[i] + nums[j] + nums[k];
				if (sum == target){
					return sum;
				}
				else if (sum > target){
					int d = sum - target;
					if (abs(d) < abs(distance)){
						distance = d;
					}
					k--;
					while (nums[k] == nums[k + 1])
						k--;
				}
				else{
					int d = sum - target;
					if (abs(d) < abs(distance)){
						distance = d;
					}
					j++;
					while (nums[j] == nums[j - 1])
						j++;
				}
			}
		}
		return target + distance;
	}
};