-
Notifications
You must be signed in to change notification settings - Fork 0
/
15.cpp
66 lines (63 loc) · 1.52 KB
/
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
vector<vector<int> > threeSum(vector<int> &num) {
sort(num.begin(),num.end());
vector<int> temp;
vector<vector<int> >res;
int len=num.size();
int s=0;
int e=0;
for(int i=0;i<len-2;i++)
{
s=i+1;
e=len-1;
while(s<e)
{
if(num[s]+num[e]+num[i]==0)
{
temp.push_back(num[i]);
temp.push_back(num[s]);
temp.push_back(num[e]);
res.push_back(temp);
temp.clear();
while(s+1<=len-2&&num[s]==num[s+1])
s++;
while(e-1>=i+2&&num[e]==num[e-1])
e--;
s++;
e--;
}
else if(num[s]+num[e]+num[i]>0)
e--;
else
s++;
}
while(num[i]==num[i+1])
i++;
}
return res;
}
};
int main()
{
vector<int> test;
vector<vector<int> >res;
test.push_back(-2);
test.push_back(0);
test.push_back(1);
test.push_back(1);
test.push_back(2);
Solution s;
res=s.threeSum(test);
for(int i=0;i<res.size();i++)
{
for(int j=0;j<res[0].size();j++)
cout<<" "<<res[i][j];
cout<<endl;
}
return 0;
}