Leetcode 016 3Sum Closest （Twopoint）

题目连接：Leetcode 016 3Sum Closest

解题思路：与 Leetcode 015 思路一样，不同的是需要维护一个最优解。

class Solution {
	public:
		int threeSumClosest(vector<int>& nums, int target) {
			int ret = 0, dist = -1;
			sort(nums.begin(), nums.end());

			int n = nums.size(), i = 0;
			while (i < n) {
				int a = nums[i];
				int j = i + 1, k = n - 1;; 

				while (j < k) {
					int b = nums[j], c = nums[k];
					int s = a + b + c;

					if (dist == -1 || abs(s - target) < dist) {
						dist = abs(s - target);
						ret = s;
					}

					if (s <= target) while (j < k && nums[j] == b) j++;
					if (s >= target) while (j < k && nums[k] == c) k--;
				}
				while (nums[i] == a && i < n) i++;
			}
			return ret;
		}
};