forked from sunstick/code-street
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path3sum_closest.cpp
More file actions
40 lines (32 loc) · 1.13 KB
/
3sum_closest.cpp
File metadata and controls
40 lines (32 loc) · 1.13 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
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).
*/
class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
int close = abs(num[0] + num[1] + num[2] - target);
int sum = num[0] + num[1] + num[2];
int n = num.size();
sort(num.begin(), num.end());
for (int i = 0; i < n; i++) {
int j = i + 1;
int k = n - 1;
while (j < k) {
int temp = num[i] + num[j] + num[k];
if (abs(temp - target) < close) {
close = abs(temp - target);
sum = temp;
}
if (temp < target)
j++;
else if (temp > target)
k--;
else
return sum;
}
}
return sum;
}
};