此题和《三数之和》原理是一样的,可以拿来练练双指针 . . .
链接如下所示:
LeetCode算法 —— 三数之和(排序 / 双指针原理)
题目:
给定一个包括 n 个整数的数组 nums 和 一个目标值 target。找出 nums 中的三个整数,使得它们的和与 target 最接近。返回这三个数的和。假定每组输入只存在唯一答案。
示例:
输入:nums = [-1,2,1,-4], target = 1
输出:2
解释:与 target 最接近的和是 2 (-1 + 2 + 1 = 2) 。
代码如下所示:
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
vector<int> judgeArr;
int goodValue = 0;
if (nums.size() < 3) return 0;
if (nums.size() == 3) return nums[0] + nums[1] + nums[2];
sort(nums.begin(), nums.end());
for (size_t i = 0; i < nums.size(); i++)
{
if (i > 0 && nums[i] == nums[i - 1]) continue;
int result = twoSumClosest(nums, i + 1, nums.size() - 1, target, nums[i]);
judgeArr.push_back(result);
}
int min = 999999;
for (size_t i = 0; i < judgeArr.size(); i++) {
if (abs(judgeArr[i] - target) < min) {
min = abs(judgeArr[i] - target);
goodValue = judgeArr[i];
}
}
return goodValue;
}
private:
int twoSumClosest(vector<int>& nums, int start, int end, int target, int value) {
int answerValue = 999999999;
int refNum = 99999999;
while (start < end) {
int sum = nums[start] + nums[end] + value;
if (abs(sum - target) < answerValue) {
answerValue = abs(sum - target);
refNum = sum;
}
else if (sum < target) {
++start;
}
else {
--end;
}
}
return refNum;
}
};