-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path4_sum.cpp
More file actions
58 lines (52 loc) · 1.62 KB
/
4_sum.cpp
File metadata and controls
58 lines (52 loc) · 1.62 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
class Solution {
public:
void add(vector<vector<int> > &ret, int a, int b, int c, int d) {
vector<int> tmp;
tmp.push_back(a);
tmp.push_back(b);
tmp.push_back(c);
tmp.push_back(d);
ret.push_back(tmp);
}
vector<vector<int> > fourSum(vector<int> &num, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > ans;
if (num.size() < 4) {
return ans;
}
sort(num.begin(), num.end());
int left, right;
for (int j = 0; j < num.size() - 3; j++) {
if (j > 0 && num[j] == num[j - 1]) {
continue;
}
for(int i=j+1;i < num.size()-2;i++) {
if (i > j+1 && num[i] == num[i - 1]) {
continue;
}
left = i + 1;
right = num.size() - 1;
while (left < right) {
if (left > i + 1 && num[left] == num[left - 1]) {
left++;
continue;
}
if (right < num.size() - 1 && num[right] == num[right + 1]) {
right--;
continue;
}
if (num[left] + num[right] == target -num[j]- num[i]) {
add(ans, num[j],num[i], num[left], num[right]);
left++;
} else if (num[left] + num[right] > target- num[j] - num[i]) {
right--;
} else {
left++;
}
}
}
}
return ans;
}
};