forked from cpselvis/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution016.cpp
More file actions
58 lines (48 loc) · 959 Bytes
/
solution016.cpp
File metadata and controls
58 lines (48 loc) · 959 Bytes
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/**
* 3Sum Closest
*
* cpselvis([email protected])
* September 17th, 2016
*/
#include<iostream>
#include<vector>
using namespace std;
class Solution {
public:
int threeSumClosest(vector<int>& nums, int target) {
int closet = nums[0] + nums[1] + nums[2];
int diff = abs(closet - target);
sort(nums.begin(), nums.end());
for (int i = 0; i < nums.size() - 2; i ++)
{
int left = i + 1;
unsigned long right = nums.size() - 1;
while (left < right)
{
int newCloset = nums[i] + nums[left] + nums[right];
int newDiff = abs(newCloset - target);
if (diff > newDiff)
{
diff = newDiff;
closet = newCloset;
}
if (newCloset < target)
{
left ++;
}
else
{
right --;
}
}
}
return closet;
}
};
int main(int argc, char **argv)
{
int arr[4] = {0, 2, 1, -3};
vector<int> vec(arr + 0, arr + 4);
Solution s;
cout << s.threeSumClosest(vec, 1) << endl;
}