https://leetcode-cn.com/problems/3sum-closest/
思路:sort+双指针,上一题的target为0,这次的target为 三数和value 最小差
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int res = INT_MAX, res_value = 0;
for (int i = 0; i < nums.size() - 1; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
int start = i + 1, end = nums.size() - 1;
while(end > start) {
int temp = nums[i] + nums[start] + nums[end];
if (temp >= target) {
if (temp - target <= res) {
res = temp - target;
res_value = temp;
}
end -= 1;
} else if (target >= temp) {
if (target - temp <= res) {
res = target - temp;
res_value = temp;
}
start += 1;
}
//cout << i << " " << start << " " << end << " " << temp << " " << res << endl;
}
}
return res_value;
}