-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15.cpp
51 lines (47 loc) · 1022 Bytes
/
15.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
43
44
45
46
47
48
49
50
51
#include<iostream>
#include<vector>
#include<map>
#include<string>
#include <algorithm>
using namespace std;
vector<vector<int> > threeSum(vector<int>& nums) {
vector<vector<int> > r;
sort(nums.begin(), nums.end());
for(int i = 0; i + 2< nums.size(); ++i) {
if(i > 0 && nums[i -1] == nums[i])
continue;
int a = nums[i];
int j = i + 1;
int k = nums.size() - 1;
while(j < k) {
if(nums[j] + nums[j + 1] + a > 0 ||
nums[k] + nums[k - 1] + a < 0)
break;
else if(nums[j] + nums[k] + a < 0)
++j;
else if(nums[j] + nums[k] + a > 0)
--k;
else {
vector<int> s;
s.push_back(a);
s.push_back(nums[j]);
s.push_back(nums[k]);
r.push_back(s);
do {
++j;
} while (j < k && nums[j-1] == nums[j]);
--k;
}
}
}
return r;
}
int main(){
vector<int> s;
// s.push_back(-1);
// s.push_back(0);
//s.push_back(1);
threeSum(s);
cout<<s.size();
return 1;
}