-
Notifications
You must be signed in to change notification settings - Fork 9
/
Copy path15_3Sum.cpp
60 lines (49 loc) · 1.26 KB
/
15_3Sum.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
//
#include "stdafx.h"
#include <assert.h>
#include <string>
//--------------------------------------------------
#include <algorithm>
class Solution {
public:
vector<vector<int> > threeSum(vector<int> &num) {
vector<vector<int>> result;
sort(num.begin(), num.end());
for (int i = 0; i < (int)num.size(); ) {
int iv = num[i];
for (int j = i + 1; j < (int)num.size(); ) {
int jv = num[j];
int kv = -(iv + jv);
if (kv >= jv) {
auto it = lower_bound(num.begin() + j + 1, num.end(), kv);
if (it != num.end() && *it == kv) {
int a[] = {iv, jv, kv};
result.push_back(vector<int>(a, a + 3));
}
}
for (++j; j < (int)num.size() && num[j] == jv; ++j);
}
for (++i; i < (int)num.size() && num[i] == iv; ++i);
}
return result;
}
};
//--------------------------------------------------
static void printResult(vector<vector<int>> const &result) {
cout << "#######" << endl;
for (auto &v : result) {
for (auto i : v) cout << i << ',';
cout << endl;
}
}
int main() {
Solution s;
{
int a[] = {-1, 0, 1, 2, -1, -4,};
printResult(s.threeSum(vector<int>(a, a + sizeof(a) / sizeof(a[0]))));
}
{
int a[] = {0, 0, 1, 2, 0, 0, -3, 4, -4};
printResult(s.threeSum(vector<int>(a, a + sizeof(a) / sizeof(a[0]))));
}
}