-
Notifications
You must be signed in to change notification settings - Fork 0
/
4-sum.cpp
55 lines (44 loc) · 1.46 KB
/
4-sum.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
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
vector<vector<int>> qu;
int n = nums.size();
if (n < 4) {
return qu;
}
sort(nums.begin(), nums.end());
for (int i = 0; i < n - 3; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
for (int j = i + 1; j < n - 2; j++) {
if (j > i + 1 && nums[j] == nums[j - 1]) {
continue;
}
long long pre = j + 1;
long long next = n - 1;
while (pre<next) {
long long sum = static_cast<long long>(nums[i]) + nums[j] + nums[pre] + nums[next];
if (sum == target) {
qu.push_back({nums[i], nums[j], nums[pre], nums[next]});
while (pre<next && nums[pre] == nums[pre + 1]) {
pre++;
}
while (pre<next && nums[next] == nums[next - 1]) {
next--;
}
pre++;
next--;
}
else if (sum < target) {
pre++;
}
else {
next--;
}
}
}
}
return qu;
}
};