-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path3Sum.cc
73 lines (55 loc) · 1.47 KB
/
3Sum.cc
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
#include <vector>
#include <string>
#include <iostream>
using std::vector;
using std::string;
using std::cout;
using std::endl;
#include <cstdlib>
using std::atoi;
struct ListNode{
int val;
ListNode *next;
ListNode(int x):val(x), next(NULL){}
};
#include <algorithm>
#include <cstring>
#include <map>
class Solution{
public:
vector<vector<int> > threeSum(vector<int> &num){
std::map<int, vector<int>::size_type> mp;
std::sort(num.begin(), num.end());
for(vector<int>::size_type i = 0; i < num.size(); ++i){
mp[num[i]] = i;
}
vector<vector<int> > ans;
for(vector<int>::size_type i = 0; i < num.size(); ++i){
if(i && num[i] == num[i-1])continue;
for(auto j = i + 1; j < num.size(); ++j){
if(j != i + 1 && num[j] == num[j - 1])continue;
auto tmp = num[i] + num[j];
auto rest = 0 - tmp;
auto fit = mp.find(rest);
if(fit != mp.end() && fit->second > j){
ans.push_back({num[i], num[j], fit->first});
}
}
}
return ans;
}
};
int main(){
Solution slu;
using std::cin;
//vector<int> num = {-1, 0, 1, 2, -1, -4};
vector<int> num = {1,0,1,2,-1,-4, -1, -1, -2, -3, -4};
auto ans = slu.threeSum(num);
for(auto &v: ans){
for(auto &a: v){
cout << a << " ";
}
cout << endl;
}
return 0;
}