LeetCode——16. 3Sum Closest

1.题目大意

给出一个数组和目标值，找到数组中三个数使得这三个数的和最接近目标值，返回这三个数的和。假定每个数组有且只有一个答案。

2.解题方法

这道题用暴力破解的时间复杂度会达到O(n³)，所以最好还是和之前的我写的leetcode的第一题：Two Sum一样，用一层循环固定一个值，再用两个指针一左一右的不断逼近来找到最接近目标值的数：

class Solution {
public:
	int threeSumClosest(vector<int>& nums, int target) {
		sort(nums.begin(), nums.end());
		int size = nums.size();
		int diff = INT_MAX;
		int result;
		for (int i = 0; i < size; i = i + 1) {
			int first = nums.at(i);
			int now_target = target - first;
			int left = i + 1;
			int right = size - 1;
			while (left < right) {
				int sum = nums.at(left) + nums.at(right);
				int now_diff = abs(now_target - sum);
				if (now_diff < diff) {
					result = sum + first;
					diff = now_diff;
				}
				if (sum > now_target)
					right = right - 1;
				else if (sum < now_target)
					left = left + 1;
				else
					return result;
			}
		}
		return result;
	}
};