[LeetCode]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).

Personal tips: 类似三数求和问题。代码如下：

class Solution {
public:
	int threeSumClosest(vector<int>& nums, int target) {
		sort(nums.begin(), nums.end());
		int i = 0, j = nums.size() - 1, min = max(abs(nums[0] + nums[1] + nums[2] - target), abs(nums[j] + nums[j - 1] + nums[j - 2] - target)), num = 0;
		if (nums.size() <= 3)
		{
			while (j >= i) { num += nums[j--]; }
			return num;
		}
		if (nums[0] + nums[1] + nums[2] >= target) return nums[0] + nums[1] + nums[2];
		if (nums[j] + nums[j - 1] + nums[j - 2] <= target) return nums[j] + nums[j - 1] + nums[j - 2];
		while (i < nums.size() - 2)
		{
			int temp = i + 1;
			j = nums.size() - 1;
			while (temp < j)
			{	
				int sum = nums[i] + nums[temp] + nums[j];
				int abs_sum = abs(sum - target);
				if (abs_sum < min)
				{
					min = abs_sum;
					num = sum;
					if (min == 0) return target;
				}
				else if (sum > target){	--j;}
				else if (sum < target){	++temp;}
			}
			while (i < nums.size() - 2 && nums[i] == nums[i + 1]){	++i;}
			++i;
		}
		return num;
	}
};