-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path3sum.cpp
More file actions
77 lines (70 loc) · 2.39 KB
/
3sum.cpp
File metadata and controls
77 lines (70 loc) · 2.39 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
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
//https://leetcode.com/problems/3sum/
#include<bits/stdc++.h>
using namespace std;
#define TOUPPER(str) transform(str.begin(), str.end(),str.begin(), ::toupper)
#define TOLOWER(str) transform(str.begin(), str.end(),str.begin(), ::tolower)
template < class T > T MAX( T a, T b ){return ( a > b ? a : b );}
template < class T > T MIN( T a, T b ){return ( a < b ? a : b );}
string getline(){string inputstr; while (inputstr.length()==0 ){ getline(cin, inputstr);} return inputstr;}
template <typename T> string to_str(const T str){stringstream stream; stream << str; return stream.str();}
string to_str(const vector<int> &v, const char delim){string s; for(int i = 0; i < v.size(); i++){s += to_string(v[i]); if(i != v.size() - 1) { s += delim;}} return s;}
template <typename T>int to_int(const T num){int val; stringstream stream; stream<<num; stream>>val; return val;}
vector<string> split(const string &s,const char delim){vector<string> elems;stringstream ss(s); string item;while(getline(ss,item,delim)){elems.push_back(item);}return elems;}
int solve(vector<int> &v){
if(v.empty()) return 0;
sort(v.begin(), v.end(), less<int>());
vector<vector<int> > res;
int sz = v.size();
for(int i = 0; i < sz; i++) {
int target = v[i];
int left = i + 1, right = sz - 1;
while(left < right) {
int sum = v[left] + v[right];
if(-1 * target == v[left] + v[right]) {
vector<int> row(3);
row[0] = target;
row[1] = v[left];
row[2] = v[right];
res.push_back(row);
int leftValue = v[left], rightValue = v[right];
while(left < sz && v[left] == leftValue) left++;
while(right > i && v[right] == rightValue) right--;
}else if(sum < -1 * target){
left++;
} else right--;
}
while(i + 1 < sz && v[i + 1] == target) i++;
}
return 0;
}
int solve(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int l;
scanf("%d", &l);
vector<int> v(l);
for(int i = 0; i < l; i++){
scanf("%d", &v[i]);
}
return solve(v);
}
int main(){
freopen("1-input", "r", stdin);
freopen("2-output", "w", stdout);
int t;
scanf("%d", &t);
while(t--){
int output = solve();
int expected;
cin>>expected;
printf("==============testcase: %d===========\n", t);
cout<<"===>output:"<<output<<" expected:"<<expected<<" result:"<<(output==expected ? "true" : "false")<<endl;
}
return 0;
}
// 1
// 4
// 1 -1 -1 0
// 6
// -1 0 1 2 -1 -4