-
Notifications
You must be signed in to change notification settings - Fork 35
/
3sumclosest.cpp
42 lines (34 loc) · 1013 Bytes
/
3sumclosest.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
31
32
33
34
35
36
37
38
39
40
41
42
//3 Sum Closest
//Question Link :- https://leetcode.com/problems/3sum-closest/
/*
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
}
};
*/
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
sort(nums.begin(), nums.end());
int closestSum = nums[0] + nums[1] + nums[2];
for (int i = 0; i < nums.size(); ++i) {
int j = i + 1;
int k = nums.size() - 1;
while (j < k) {
int sum = nums[i] + nums[j] + nums[k];
if (abs(target - sum) < abs(target - closestSum)) {
closestSum = sum;
}
if (sum < target) {
++j;
} else if (sum > target) {
--k;
} else {
return target;
}
}
}
return closestSum;
}
};