LeetCode | 16. 3Sum Closest 循环技巧题

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

    For example, givenarray S = {-1 2 1 -4}, and target = 1.

 

    The sum that isclosest to the target is 2. (-1 + 2 + 1 = 2).

这一题真的是纠结了太长时间了，通过这一题，我学会了，以后在做题的时候一定要记得切分程序，不要把程序都写在同一个地方，这样是很费时间的，通过这一题我学会了求一个范围内某两个值的和和target最接近的求法，

我还学会了在N个值里面里面取m个值的全排列的方法，使用for循环就行了，在N个值里面取N-1个数的全排列方法，使用一个tmp可以很快的解决，如果不确定for有多少个或者是for循环的层数过多，可以使用递归实现这个方法！

class Solution {
public:
int getTheMin(int str, int end, vector<int> nums, int target)
{
	int tmp = nums[str] + nums[str + 1]; int l;
	while (1)
	{
		if (str + 1 == end) break;
		if (nums[str] + nums[end] < target)
		{
			while ((l=nums[str] + nums[end]) < target&&str + 1 < end) str++;
			if (l == target) return target;
			if (abs(tmp - target) > abs(l - target)) tmp = l;
			if (abs(tmp - target) > abs((l = nums[str - 1] + nums[end]) - target)) tmp = l;
		}
		else
		{
			while ((l = nums[str] + nums[end]) > target&&str < end - 1 ) end--;
			if (l == target) return target;
			if (abs(tmp - target) > abs(l - target)) tmp = l;
			if (abs(tmp - target) > abs((l = nums[str] + nums[end+1]) - target)) tmp = l;
		}
	}
	return tmp;
}

int threeSumClosest(vector<int>& nums, int target) {
	sort(nums.begin(), nums.end());
	int l, begin, end;
	int tmp,all;

	all = nums[0] + nums[1] + nums[2];

	for (int i = 0; i <= nums.size()-3; i++)
	{
		tmp = nums[i] + getTheMin(i + 1, nums.size() - 1, nums, target-nums[i]);
		if (tmp == target) return target;
		if (abs(tmp - target) < abs(all - target)) all = tmp;
	}
	return all;
}
};