-
Notifications
You must be signed in to change notification settings - Fork 14
/
3Sum Closest.cpp
30 lines (30 loc) · 910 Bytes
/
3Sum Closest.cpp
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
/*
1 sort
2 k>j, k+1<num.size()
*/
class Solution {
public:
int threeSumClosest(vector<int> &num, int target) {
int res = 0;
bool find = false;
sort(num.begin(), num.end());
for (int i = 0; i<num.size(); i++){
for (int j = i+1, k = num.size()-1; j<k; j++){
while (k>j && num[i]+num[j]+num[k] > target){
k--;
}
if (k>j && (!find ||
abs(num[i]+num[j]+num[k]-target)<abs(res-target))){
find = true;
res = num[i]+num[j]+num[k];
}
if (k+1<num.size() && (!find ||
abs(num[i]+num[j]+num[k+1]-target)<abs(res-target))){
find = true;
res = num[i]+num[j]+num[k+1];
}
}
}
return res;
}
};