forked from CodersForLife/Data-Structures-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFourSum.cpp
More file actions
58 lines (50 loc) · 1.35 KB
/
Copy pathFourSum.cpp
File metadata and controls
58 lines (50 loc) · 1.35 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
58
#include <iostream>
#include <vector>
using namespace std;
vector<vector<int> > fourSum(vector<int>& nums, int target)
{
sort(nums.begin(), nums.end());
int n = nums.size();
vector<vector<int> > ans;
int i = 0;
while (i < n) {
int j = i + 1;
while (j < n) {
int s = j + 1, e = n - 1;
while (s < e) {
int cSum = nums[i] + nums[j] + nums[s] + nums[e];
if (cSum == target) {
vector<int> temp = { nums[i], nums[j], nums[s], nums[e] };
ans.push_back(temp);
s += 1;
e -= 1;
while (s < n && nums[s] == nums[s - 1])
s += 1;
while (e >= 0 && nums[e] == nums[e + 1])
e -= 1;
}
else if (cSum > target)
e -= 1;
else
s += 1;
}
j += 1;
while (j < n && nums[j] == nums[j - 1])
j += 1;
}
i += 1;
while (i < n && nums[i] == nums[i - 1])
i += 1;
}
return ans;
}
int main() {
vector<int> array;
int number, target;
cin>>target;
while (cin >> number) {
array.push_back(number);
}
cout << fourSum(array, target) << endl;
return 0;
}