-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path3Sum_Closest.cpp
More file actions
56 lines (52 loc) · 1.05 KB
/
Copy path3Sum_Closest.cpp
File metadata and controls
56 lines (52 loc) · 1.05 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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <iostream>
#include <vector>
#include <cstdlib>
#include <algorithm>
using namespace std;
//class Solution {
//public:
// int threeSumClosest(vector<int>& nums, int target) {
int main(){
int i=0, j, k;
int s1=0,s2=0;
// input
vector<int> nums;
string ss;
string tmp;
int target;
getline(cin,ss);
ss+=" ";
while(s1<ss.size()){
if(ss[s1]==' '){
tmp=ss.substr(s2,s1-s2);
j = atoi(tmp.c_str());
nums.push_back(j);
s2=s1;
}
s1++;
}
cin >> target;
sort(nums.begin(),nums.end());
int min=abs(nums[0]+nums[1]+nums[2]-target);
int min_value=nums[0]+nums[1]+nums[2];
int value;
vector<int> store;
for(i=0;i<nums.size()-2;i++){
j=i+1;
k = nums.size()-1;
while(j<k){
value = nums[i]+nums[j]+nums[k];
if(abs(value-target)<min){
min = abs(value-target);
min_value=value;
}else if(value>target){
k--;
}else{
j++;
}
}
}
cout<<min_value<<endl;
return 0;
}
//};