LeetCode解题分享：16. 3Sum Closest

Problem

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

Example:

Given array nums = [-1, 2, 1, -4], and target = 1.
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

解题思路

   这一道题是3Sum问题的变形，本质上和3Sum是一致的，只需要在代码中添加一些判断条件即可。

   代码如下：

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        sort(nums.begin(), nums.end());

		int closest = INT_MAX>>2;

		for (size_t i = 0; i < nums.size() - 2; ++i)
		{
			size_t left = i + 1;
			size_t right = nums.size() - 1;
			while (left < right)
			{
				if (nums[i] + nums[left] + nums[right] == target)
				{
					return target;
				}
				if (std::abs(nums[i] + nums[left] + nums[right] - target) < std::abs(closest - target))
				{
					closest = nums[i] + nums[left] + nums[right];
				}
				if (nums[i] + nums[left] + nums[right] < target)
				{
					left++;
				}
				if (nums[i] + nums[left] + nums[right] > target)
				{
					right--;
				}
			}
		}
		return closest;
    }
};