【LeetCode】16. 3Sum Closest（C++）

地址：https://leetcode.com/problems/3sum-closest/

题目：

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:

理解：

和刚才的3sum好像，只是这里不再是和为0，而是最接近target，其实是一样的思路。还是排序以后，既可以跳过重复值，又可以方便双指针进行移动。如果和大于target，可以把右指针左移；如果小于可以把左指针右移。

实现：

class Solution {
public:
	int threeSumClosest(vector<int>& nums, int target) {
		int closest = nums[0]+nums[1]+nums[2];
		sort(nums.begin(), nums.end());
		for (int i = 0; i < nums.size(); ++i) {
			int l = i + 1, r = nums.size() - 1;
			while (l < r) {
				int sum = nums[i] + nums[l] + nums[r];
				if (sum == target) return target;
				if (abs(sum - target) < abs(closest - target)) {
					closest = sum;
				}
				if (sum < target) {
					int left = nums[l];
					while (l < r&&nums[l] == left) ++l;
				}
				else if (sum > target) {
					int right = nums[r];
					while (l < r&&nums[r] == right) --r;
				}				
			}
			while (i + 1 < nums.size() && nums[i + 1] == nums[i])
				++i;
		}
		return closest;
	}
};