LeetCode 16. 3Sum Closest（Two Pointers）C++

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.
给定一个n个整数的数组nums和一个目标，在nums中找到三个整数，使之和最接近目标。返回三个整数的和。
您可以假设每个输入都确定有一个答案。

Example 1:

Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Constraints:

3 <= nums.length <= 10^3
-10^3 <= nums[i] <= 10^3
-10^4 <= target <= 10^4

算法：Two Pointers

low和high是2个pointers，low从i+1开始往右移动，high从nums.size()-1，也就是从end()开始往左移，每次移动都计算新的cursum，如果cursum - target比之前的还要小，则更新result。

C++

class Solution {
public:
    int threeSumClosest(vector<int>& nums, int target) {
        int result = nums[0]+nums[1]+nums[2];
        sort(nums.begin(),nums.end());
        for(int i=0;i<(int)nums.size()-2;i++){
        	int low = i+1;
        	int high = nums.size() - 1;
        	while(low < high){
        		int cursum = nums[i] + nums[low] +nums[high];
        		if(cursum > target){
        			high--;
				}else{
					low++;
				}
				if( abs(cursum - target) < abs(result - target) ){
					result = cursum;
				}
			}
		}
    return result;
	}
};