Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution.
For example, given array S = {-1 2 1 -4}, and target = 1. The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).题意:求集合中三个数和最接近目标数字的结果
思路:和上面那道题目LeetCode 3Sum差不多,少了去重
class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
sort(num.begin(), num.end());
int ans;
int flag = 1;
for (int i = 0; i < num.size(); i++) {
int s = i + 1;
int e = num.size() - 1;
while (s < e) {
int sum = num[i] + num[s] + num[e];
if (flag) {
ans = sum;
flag = 0;
} else if (abs(sum-target) < abs(ans-target))
ans = sum;
if (sum == target) return sum;
if (sum > target)
e--;
else if (sum < target)
s++;
}
}
return ans;
}
};