3sum_Closet

1.问题描述

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

2.问题分析

先排序，然后使用左右夹逼，时间复杂度O(n^2)。

3.代码

class Solution
{
public:
	int threeSumCloset(vector<int>&num, int target)
	{
		int result = 0;					//初始化结果
		int min_gap = INT_MAX;			//初始化最小差值
		sort(num.begin(), num.end());	//排序

		//先定一个数的值，再使用夹逼（将3sum转化为2sum）
		for(auto a = num.begin();a != prev(num.end(),2);++a)
		{
			auto b = next(a);			//初始化b为a后一个数
			auto c = prev(num.end());	//初始化c为最后一个数

			//当b和c未相遇，相向而行，获取三个数的和，与target做差，记录最小差值
			while(b < c)	
			{
				const int sum = *a+*b+*c;
				const int gap = abs(sum - target);

				//如果当前的gap小于之前记录的差值，
				//更新result的值为当前sum，更新最小gap
				if(gap < min_gap)
				{
					result = sum;	
					min_gap = gap;
				}

				if(sum < target) ++b;	//和小于target，将b后移
				else --c;				//和大于target，将c前移
			}
		}
		return result;	
	}
};

4.总结

本题的关键在于：
1、先排序；
2、将三个数之和转化为两个数之和，左右夹逼。